[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
Computes the strongly connected components of a graph
- a graph structure
- list of lists of integer node numbers
Computes the strongly connected components, i.e. maximal subsets
of the graph's nodes in which all nodes are mutually accessible.
The implementation essentially uses Tarjan's algorithm with a
complexity of O(Nnodes + Nedges).
Modes and Determinism
- strong_components(+, -) is det