Expand description
Algorithms related to graph connectivity.
Modules
Strongly connected components algorithms.
Functions
condensation
, kosaraju_scc
and tarjan_scc
are taken from the ‘petgraph’ crate.Functions
Find all articulation points in a simple undirected graph.
[Generic] Return the number of connected components of the graph.
Find all bridges in a simple undirected graph.
[Generic] Check if there exists a path starting at
from
and reaching to
.