Import std.algo.search
ShortestPaths
class
Public Class ShortestPaths<N, C>
The cheapest paths from a start to every node it reaches, as DijkstraAll finds them.
-
The nodes reached, the cheapest first, the start among them.
-
Whether the search reached the
node. -
The cost of the cheapest path from the start to the
node, or Null for one it didn't reach. -
The
nodebefore this one on its cheapest path from the start, or Null for the start or one the search didn't reach. -
The cheapest path from the start to the
node, both included, or Null for one it didn't reach.
Report an issue with this page or with FutureBlitz on GitHub.