CCGraph.Traverse
Traversal of the given graph, starting from a sequence of vertices, using the given bag to choose the next vertex to explore. Each vertex is visited at most once.
One-shot traversal of the graph using a tag set and the given bag.
val dijkstra :
tbl:'v set ->
?dist:('e -> int) ->
graph:('v, 'e) t ->
'v iter ->
('v * int * ('v, 'e) path) iter_once
Dijkstra algorithm, traverses a graph in increasing distance order. Yields each vertex paired with its distance to the set of initial vertices (the smallest distance needed to reach the node from the initial vertices).
module Event : sig ... end