module Dijkstra:
Parameters: |
|
val shortest_path : Path.G.t -> G.V.t -> G.V.t -> Path.G.E.t list * W.t
shortest_path g v1 v2
computes the shortest path from vertex v1
to vertex v2
in graph g
. The path is returned as the list of
followed edges, together with the total length of the path.