Function dijkstra

dijkstra<W>(monoid, order): ((edgeWeight) => ((start) => ((graph) => W[])))
Calculates the shortest distances by vertices in Dijkstra's method.
Type Parameters
- W
Parameters
- monoid: Monoid<W>
  The Monoid instance for W.
- order: HasInf<W>
  The total order for W.
Returns ((edgeWeight) => ((start) => ((graph) => W[])))
The shortest distances by vertices.
- - (edgeWeight): ((start) => ((graph) => W[]))
  - Parameters
    - edgeWeight: ((edge) => W)
      (edge): W
      Parameters
      edge: Edge
      Returns W
    Returns ((start) => ((graph) => W[]))
    - - (start): ((graph) => W[])
      - Parameters
        start: Vertex
        Returns ((graph) => W[])
        (graph): W[]
        Parameters
        graph: Graph
        Returns W[]
- Defined in src/graph.ts:526

Generated using TypeDoc