Closed abstractqqq closed 4 months ago
Implemented using Dijkstra in petgraph.
Essentially another shortest path algorithm that returns only (1) whether it is reachable (2) Distance assuming constant cost. However, this is way faster to compute so is better to use this as a filter
Implemented using Dijkstra in petgraph.
Essentially another shortest path algorithm that returns only (1) whether it is reachable (2) Distance assuming constant cost. However, this is way faster to compute so is better to use this as a filter