public class RandomWalkSTBetweenness extends AbstractRanker
Running time is: O(n^3).
Modifier and Type | Field and Description |
---|---|
static java.lang.String |
CENTRALITY |
DEFAULT_EDGE_WEIGHT_KEY
Constructor and Description |
---|
RandomWalkSTBetweenness(UndirectedGraph g,
Vertex s,
Vertex t)
Constructor which initializes the algorithm
|
Modifier and Type | Method and Description |
---|---|
protected void |
computeBetweenness() |
double |
computeSTBetweenness(Vertex ithVertex,
Vertex source,
Vertex target) |
protected double |
evaluateIteration()
Evaluate the result of the current interation.
|
protected Indexer |
getIndexer() |
java.lang.String |
getRankScoreKey()
the user datum key used to store the rank scores
|
protected cern.colt.matrix.DoubleMatrix2D |
getVoltageMatrix() |
protected void |
setUp() |
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 RandomWalkSTBetweenness(UndirectedGraph g, Vertex s, Vertex t)
g
- the graph whose nodes are to be analyzeds
- the source vertext
- the target vertexprotected Indexer getIndexer()
protected cern.colt.matrix.DoubleMatrix2D getVoltageMatrix()
protected void setUp()
protected void computeBetweenness()
public double computeSTBetweenness(Vertex ithVertex, Vertex source, Vertex target)
public java.lang.String getRankScoreKey()
getRankScoreKey
in class AbstractRanker
protected double evaluateIteration()
IterativeProcess
evaluateIteration
in class IterativeProcess