Skip to content
FutureBlitz

    Install

    Import std.algo.search

    ShortestPaths

    std.algo.search

    class

    Public Class ShortestPaths<N, C>

    The cheapest paths from a start to every node it reaches, as DijkstraAll finds them.

    std/algo/search.fb, line 35

    • Public Property Nodes: N[] property #

      The nodes reached, the cheapest first, the start among them.

    • Public Method Contains(node: N): Bool method #

      Whether the search reached the node.

    • Public Method CostTo(node: N): C? method #

      The cost of the cheapest path from the start to the node, or Null for one it didn't reach.

    • Public Method Parent(node: N): N? method #

      The node before this one on its cheapest path from the start, or Null for the start or one the search didn't reach.

    • Public Method PathTo(node: N): N[]? method #

      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.