Average Path Length
Jeremy Guillette edited this page Mar 6, 2016
·
2 revisions
The average graph-distance between all pairs of nodes.
Connected nodes have graph distance 1. The diameter is the longest graph distance between any two nodes in the network. (i.e. How far apart are the two most distant nodes). Two measures derive from the distance: Betweenness Centrality and Closeness 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