Connected Components

Sébastien Heymann edited this page Mar 1, 2015 · 1 revision
Clone this wiki locally

Determines the number of connected components in the network.


On directed graphs: detect strongly and weakly connected components.

On undirected graphs: detect only weakly connected components.

Source code



This code was implemented by Patrick McSweeney.

Implemented Algorithm

Robert Tarjan, Depth-First Search and Linear Graph Algorithms, in SIAM Journal on Computing 1 (2): 146–160 (1972)

Additional Reading