Skip to main content

Module scc

Module scc 

Source
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.