condor-pathfinding-grid 0.4.0

Grid pathfinding, preprocessing, replanning, and multi-agent algorithms for Condor.
Documentation

Grid-domain owner crate for discrete pathfinding substrate.

This domain crate owns the map model ([Grid]), discrete and any-angle search contracts ([Pathfinder], [AnyAnglePathfinder]), prepared / preprocessed multi-query maps, flow fields, hierarchical abstracts, MAPF starter surface, and incremental replanning traits. Algorithm implementations live under [algorithms]; root re-exports form the curated consumer surface that the public facade (condor-for-games / lib condor) mirrors for compatibility.

Not polygonal / navmesh routing — those live in sibling domain crates. This owner crate depends on neutral core contracts, never on the public facade; corpus conformance and capture evidence live in private developer packages.

Choose a grid surface

Need Start with
One static 4-connected query [AStar] via [Pathfinder]
Straight-line paths through a grid [AnyAnglePathfinder] implementations
Many queries over one static grid [PreprocessedGridBuilder] or a domain-specific prepared builder
Changing costs or blocked cells [GridReplanner] / [InterpolatedGridReplanner]
Multiple agents [MapfStarterPlanner]

Example

use condor_grid::{AStar, Cell, Grid, Pathfinder, Point, SearchRequest};

let mut grid = Grid::new(3, 3).expect("grid dimensions are valid");
grid.set_cell(Point::new(1, 1), Cell::Blocked)
    .expect("point is in bounds");
let result = AStar.search(
    &grid,
    SearchRequest::new(Point::new(0, 0), Point::new(2, 2)),
).expect("request is valid");
assert!(result.is_found());