Module connect

Algorithms related to graph connectivity.

Modules

scc

Strongly connected components algorithms. Functions condensation, kosaraju_scc and tarjan_scc are taken from the ‘petgraph’ crate.

Functions

articulation_points

Find all articulation points in a simple undirected graph.

connected_components

[Generic] Return the number of connected components of the graph.

find_bridges

Find all bridges in a simple undirected graph.

has_path_connecting

[Generic] Check if there exists a path starting at from and reaching to.