Expand description
Connectivity: strongly-connected components, bridges, articulation points, biconnected.
Re-exports§
pub use articulation_points::articulation_points;pub use biconnected::biconnected_components;pub use bridges_tarjan::bridges_tarjan;pub use k_core::KCoreResult;pub use k_core::core_numbers;pub use k_core::degeneracy;pub use k_core::degeneracy_ordering;pub use k_core::k_core_decomposition;pub use k_core::k_core_subgraph;pub use scc_gabow::scc_gabow;pub use scc_kosaraju::scc_kosaraju;pub use scc_tarjan::scc_tarjan;
Modules§
- articulation_
points - Articulation points (cut vertices) via Tarjan’s low-link algorithm.
- biconnected
- Biconnected components (edge-disjoint blocks of an undirected graph).
- bridges_
tarjan - Bridges (cut edges) via Tarjan’s low-link algorithm on undirected graphs.
- k_core
- k-core decomposition via the Batagelj-Zaversnik linear-time bucket method.
- scc_
gabow - Gabow’s SCC algorithm using two stacks.
- scc_
kosaraju - Kosaraju’s algorithm: two DFS passes.
- scc_
tarjan - Tarjan’s strongly-connected components, O(V + E).