Module pathfinding::directed::dijkstra
source · Expand description
Compute a shortest path using the Dijkstra search algorithm.
Structs§
- Struct returned by
dijkstra_reach
. - Information about a node reached by
dijkstra_reach
.
Functions§
- Build a path leading to a target according to a parents map, which must contain no loop. This function can be used after
dijkstra_all
ordijkstra_partial
to build a path from a starting point to a reachable target. - Compute a shortest path using the Dijkstra search algorithm.
- Determine all reachable nodes from a starting point as well as the minimum cost to reach them and a possible optimal parent node using the Dijkstra search algorithm.
- Determine some reachable nodes from a starting point as well as the minimum cost to reach them and a possible optimal parent node using the Dijkstra search algorithm.
- Visit all nodes that are reachable from a start node. The node will be visited in order of cost, with the closest nodes first.