Determines the betweenness centrality values of a graph using Brandes' algorithm On variants of shortest-path betweenness centrality and their generic computation .
var nodes =id: 0 outEdges: 1id: 1 ;var betweenness = ;betweenness;
npm install betweenness
Supported Betweenness Types
||Classic shortest-path betweenness, the score of
|Vertex Betweenness with Endpoints||
||Same as before, adds to the score of a
||The score of an edge
In Brandes' paper more variants are listed and it is easy to add them to the implementation. If you miss a variation feel free to add it.