public class BetweennessCentrality extends AbstractRanker
A simple example of usage is:
BetweennessCentrality ranker = new BetweennessCentrality(someGraph); ranker.evaluate(); ranker.printRankings();Running time is: O(n^2 + nm).
Modifier and Type | Field and Description |
---|---|
static java.lang.String |
CENTRALITY |
DEFAULT_EDGE_WEIGHT_KEY
Constructor and Description |
---|
BetweennessCentrality(Graph g)
Constructor which initializes the algorithm
|
BetweennessCentrality(Graph g,
boolean rankNodes) |
BetweennessCentrality(Graph g,
boolean rankNodes,
boolean rankEdges) |
Modifier and Type | Method and Description |
---|---|
protected void |
computeBetweenness(Graph graph) |
protected double |
evaluateIteration()
Evaluate the result of the current interation.
|
java.lang.String |
getRankScoreKey()
the user datum key used to store the rank scores
|
assignDefaultEdgeTransitionWeights, finalizeIterations, getEdgeWeight, getEdgeWeightKeyName, getGraph, getRankings, getRankScore, getRankScores, getVertices, initialize, isRankingEdges, isRankingNodes, normalizeEdgeTransitionWeights, normalizeRankings, onFinalize, printRankings, reinitialize, setEdgeWeight, setNormalizeRankings, setRankScore, setRemoveRankScoresOnFinalize, setUserDefinedEdgeWeightKey
evaluate, getDesiredPrecision, getIterations, getMaximumIterations, getPrecision, hasConverged, initializeIterations, relativePrecision, setDesiredPrecision, setMaximumIterations
public static final java.lang.String CENTRALITY
public BetweennessCentrality(Graph g)
g
- the graph whose nodes are to be analyzedpublic BetweennessCentrality(Graph g, boolean rankNodes)
public BetweennessCentrality(Graph g, boolean rankNodes, boolean rankEdges)
protected void computeBetweenness(Graph graph)
public java.lang.String getRankScoreKey()
getRankScoreKey
in class AbstractRanker
protected double evaluateIteration()
IterativeProcess
evaluateIteration
in class IterativeProcess