Expand description
Strongly Connected Components (SCC) algorithms.
A strongly connected component is a maximal subgraph where every node can reach every other node. This module provides:
- Tarjan’s algorithm (sequential, O(V+E))
- Kosaraju’s algorithm (can be parallelized)
Structs§
- SccConfig
- SCC configuration.
Functions§
- count_
components - Get number of SCCs from component assignment.
- get_
component_ members - Get nodes in each component.
- scc_
kosaraju - Kosaraju’s SCC algorithm.
- scc_
kosaraju_ with_ config - Kosaraju’s algorithm with configuration.
- scc_
tarjan - Tarjan’s SCC algorithm (sequential).
- scc_
tarjan_ with_ config - Tarjan’s algorithm with configuration.