Module graphs

Source
Expand description

Methods for graph processing.

Modulesยง

bfs
Breadth-first distance labeling.
bijkstra
Bi-directional Dijkstra distance labeling.
propagate
Directed label reachability.
scc
Strongly connected component structure.
sequential
Sequential (non-concurrent) graph algorithms.