Class MarkovCentrality<V,E>
- java.lang.Object
-
- edu.uci.ics.jung.algorithms.util.IterativeProcess
-
- edu.uci.ics.jung.algorithms.importance.AbstractRanker<V,E>
-
- edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker<V,E>
-
- edu.uci.ics.jung.algorithms.importance.MarkovCentrality<V,E>
-
- All Implemented Interfaces:
IterativeContext
public class MarkovCentrality<V,E> extends RelativeAuthorityRanker<V,E>
- See Also:
- "Algorithms for Estimating Relative Importance in Graphs by Scott White and Padhraic Smyth, 2003"
-
-
Field Summary
Fields Modifier and Type Field Description static java.lang.StringMEAN_FIRST_PASSAGE_TIME-
Fields inherited from class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker
priorRankScoreMap
-
Fields inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker
edgeRankScores, vertexRankScores
-
-
Constructor Summary
Constructors Constructor Description MarkovCentrality(edu.uci.ics.jung.graph.DirectedGraph<V,E> graph, java.util.Set<V> rootNodes)MarkovCentrality(edu.uci.ics.jung.graph.DirectedGraph<V,E> graph, java.util.Set<V> rootNodes, java.util.Map<E,java.lang.Number> edgeWeightKey)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.lang.StringgetRankScoreKey()The user datum key used to store the rank score.doublegetVertexRankScore(V vert)Given an edge or node, returns the corresponding rank score.voidstep()Evaluate the result of the current iteration.-
Methods inherited from class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker
finalizeIterations, getPriorRankScore, getPriors, setPriorRankScore, setPriors
-
Methods inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker
assignDefaultEdgeTransitionWeights, getEdgeRankScore, getEdgeRankScore, getEdgeRankScores, getEdgeRankScores, getEdgeWeight, getEdgeWeights, getGraph, getRankings, getRankScores, getVertexCount, getVertexRankScore, getVertexRankScores, getVertexRankScores, getVertices, initialize, isRankingEdges, isRankingNodes, normalizeEdgeTransitionWeights, normalizeRankings, onFinalize, printRankings, removeEdgeRankScore, removeEdgeRankScore, removeVertexRankScore, removeVertexRankScore, reset, setEdgeRankScore, setEdgeRankScore, setEdgeWeight, setEdgeWeights, setNormalizeRankings, setRemoveRankScoresOnFinalize, setVertexRankScore, setVertexRankScore
-
Methods inherited from class edu.uci.ics.jung.algorithms.util.IterativeProcess
done, evaluate, getDesiredPrecision, getIterations, getMaximumIterations, getPrecision, hasConverged, initializeIterations, relativePrecision, setDesiredPrecision, setMaximumIterations, setPrecision
-
-
-
-
Field Detail
-
MEAN_FIRST_PASSAGE_TIME
public static final java.lang.String MEAN_FIRST_PASSAGE_TIME
- See Also:
- Constant Field Values
-
-
Method Detail
-
getRankScoreKey
public java.lang.String getRankScoreKey()
Description copied from class:AbstractRankerThe user datum key used to store the rank score.- Specified by:
getRankScoreKeyin classAbstractRanker<V,E>- Returns:
- the key
- See Also:
AbstractRanker.getRankScoreKey()
-
getVertexRankScore
public double getVertexRankScore(V vert)
Description copied from class:AbstractRankerGiven an edge or node, returns the corresponding rank score. This is a default implementation of getRankScore which assumes the decorations are of type MutableDouble. This method only returns legal values ifsetRemoveRankScoresOnFinalize(false)was called prior toevaluate().- Overrides:
getVertexRankScorein classAbstractRanker<V,E>- Returns:
- the rank score value
- See Also:
AbstractRanker.getVertexRankScore(Object)
-
step
public void step()
Description copied from class:IterativeProcessEvaluate the result of the current iteration.- Specified by:
stepin interfaceIterativeContext- Specified by:
stepin classIterativeProcess- See Also:
IterativeProcess.step()
-
-