Package | Description |
---|---|
dev.nm.graph.community |
Class and Description |
---|
EdgeBetweeness
The edge betweenness centrality is defined as the number of the shortest paths that go through an
edge in a graph or network.
|
GirvanNewman
The Girvan–Newman algorithm detects communities in complex systems.
|
GirvanNewman.EdgeBetweenessCtor
This allows customization of the computation of edge-betweeness.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.