Function dijkstra

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