Expand description
Provides methods for pathfinding using Dijkstra’s Shortest Paths algorithm
Structs§
Traits§
- Dijkstra
Node - A simple trait encapsulating what other traits are needed for a type to be usable in Dijkstra’s Algorithm.
Functions§
- shortest_
path_ generic - Calculates a shortest path from
start
togoal
using Dijkstra’s Algorithm. - shortest_
path_ position - shortest_
path_ position_ multistart - shortest_
path_ roomxy - shortest_
path_ roomxy_ multistart