Connected Components

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

Determines the number of connected components in the network.

Explanation

On directed graphs: detect strongly and weakly connected components.

On undirected graphs: detect only weakly connected components.

Source code

See org.gephi.statistics.plugin.ConnectedComponents.java.

Acknowledgments

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

Clone this wiki locally
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.
Press h to open a hovercard with more details.