Crate rustsim_pathfinding 

Pathfinding algorithms for agent-based models.

Provides:

• astar – generic A* over any graph/node type, plus grid-specific variants
• metrics – pluggable cost metrics (DirectDistance, MaxDistance, Manhattan, PenaltyMap)
• continuous_astar – continuous-space A* with automatic discretization (2D and 3D)
• route – route planning and step-along-route movement for agents
• route_choice – multinomial logit (MNL) route choice model
• walkability – walkable-cell queries and random walkable position utilities
• yen – Yen’s K-shortest loopless paths algorithm

Mirrors Julia Agents.jl Pathfinding submodule.

Modules

astar

A* pathfinding – generic and grid-specific variants.

continuous_astar

Continuous-space A* pathfinding.

metrics

Cost metrics for A* pathfinding.

prelude

Re-exports of pathfinding types and functions.

route

Route planning and step-along-route API for agents.

route_choice

Multinomial logit (MNL) route choice model.

walkability

Walkability query utilities for pathfinding.

yen

Yen’s K-shortest loopless paths algorithm.