1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//! Algorithm taxonomy re-exported from owner crates, grouped by search contract.
//!
//! # Facade role
//!
//! Implementations live in owner crates (`condor-pathfinding-grid`,
//! `condor-pathfinding-navmesh`). This module is a **documentation and path
//! taxonomy** on the public facade: feature-gated re-exports only, no local
//! solver bodies. Prefer crate-root imports for application code; use this
//! module when browsing rustdoc by lane.
//!
//! # Choose a lane
//!
//! - **Static grid** ([`crate::Pathfinder`]): [`astar`],
//! [`dijkstra`], [`bfs`],
//! [`bidirectional_bfs`],
//! [`jump_point_search`],
//! [`rectangular_symmetry_reduction`];
//! shared cardinal-JPS helpers in [`jps_cardinal`]
//! - **Any-angle** ([`crate::AnyAnglePathfinder`]):
//! [`theta_star`], [`lazy_theta_star`],
//! [`anya`]
//! - **Navmesh** ([`crate::NavmeshPathfinder`]): [`channel_search`],
//! [`ta_star`]; prepared [`tra_star`] builders
//! - **Preprocessed grid**: [`hpastar`], [`subgoal_graph`], [`jps_plus`]
//! - **Dynamic replanning** ([`crate::GridReplanner`]):
//! [`lifelong_planning_astar`],
//! [`d_star_lite`]
//! - **Interpolated replanning** ([`crate::InterpolatedGridReplanner`]):
//! [`field_d_star`]
//!
//! # Cost model
//!
//! Per-cell `traversal_cost` applies to grid [`crate::Pathfinder`] solvers except
//! [`bfs`] and [`bidirectional_bfs`], which count
//! unit hops. [`hpastar`] rejects non-uniform weights at preprocess.
//! JPS and RSR sum `traversal_cost` along cardinal segments but prune with Manhattan geometry.
//! Any-angle and navmesh lanes use Euclidean segment length.
//!
//! # Consumer imports
//!
//! Endorsed solvers are re-exported at the crate root, for example
//! `use condor::{AStar, Grid, Pathfinder};`. [`crate::SolverPortfolio`] maps
//! problem models to the current recommended public entrypoints.
pub use channel_search;
pub use ta_star;
pub use tra_star;
pub use anya;
pub use astar;
pub use bfs;
pub use bidirectional_bfs;
pub use d_star_lite;
pub use dijkstra;
pub use field_d_star;
pub use hpa_star as hpastar;
pub use jps_cardinal;
pub use jps_plus;
pub use jump_point_search;
pub use lazy_theta_star;
pub use lifelong_planning_astar;
pub use rectangular_symmetry_reduction;
pub use subgoal_graph;
pub use theta_star;