Betweenness Centrality
Sébastien Heymann edited this page Mar 1, 2015
·
1 revision
Node Betweenness Centrality measures how often a node appears on shortest paths between nodes in the network.
http://en.wikipedia.org/wiki/Betweenness#Betweenness_centrality
See org.gephi.statistics.plugin.GraphDistance.java.
This code was implemented by Patrick McSweeney.
Ulrik Brandes (2001). A faster algorithm for betweenness centrality
- 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