This allows customization of the computation of edge-betweeness.
The edge betweenness centrality is defined as the number of the shortest paths that go through an edge in a graph or network.
|GirvanNewman<V,E extends UndirectedEdge<V>,G extends UnDiGraph<V,E>>||
The Girvan–Newman algorithm detects communities in complex systems.
|GirvanNewmanUnDiGraph<V,E extends UndirectedEdge<V>>|
Copyright © 2010-2018 Numerical Method Incorporation Limited. All Rights Reserved.