Connected Components
Jonathan Paugh edited this page Jan 3, 2019
·
2 revisions
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.
See org.gephi.statistics.plugin.ConnectedComponents.java.
This code was implemented by Patrick McSweeney.
Robert Tarjan, Depth-First Search and Linear Graph Algorithms, in SIAM Journal on Computing 1 (2): 146–160 (1972)
- Developer Handbook
- Build
- Code Style
- Localization
- Datasets
- Import CSV Data
- Import Dynamic Data
- Scripting Plugin
- Quick Start
- Démarrage rapide (FR)
- Layout
- Spatialisations (FR)
- Statistics
- Import
- Spigot importer with Wizard
- Export
- Generator
- Filter
- Extend Data Laboratory
- Preview renderer
- Add a module panel
- Add a submenu
- Build a plugin without Gephi source code
- Update a plugin
- Code Sharing Strategy
- Graph Streaming