rustsim-pathfinding 0.0.1

Generic A* and grid-specific pathfinding for rustsim
Documentation
  • Coverage
  • 91.18%
    93 out of 102 items documented8 out of 63 items with examples
  • Size
  • Source code size: 117.71 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.74 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 34s Average build duration of successful builds.
  • all releases: 34s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Repository
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • federicomarcantognini

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.