public class DegreeDistributionRanker extends AbstractRanker
A simple example of usage is:
DegreeDistributionRanker ranker = new DegreeDistributionRanker(someGraph); ranker.evaluate(); ranker.printRankings();
Modifier and Type | Field and Description |
---|---|
static java.lang.String |
KEY |
DEFAULT_EDGE_WEIGHT_KEY
Constructor and Description |
---|
DegreeDistributionRanker(Graph graph)
Default constructor which assumes if the graph is directed the indegree is to be used.
|
DegreeDistributionRanker(Graph graph,
boolean useInDegree)
This constructor allows you to specify whether to use indegree or outdegree.
|
Modifier and Type | Method and Description |
---|---|
protected double |
evaluateIteration()
Evaluate the result of the current interation.
|
java.lang.String |
getRankScoreKey()
The user datum key used to store the rank score.
|
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 KEY
public DegreeDistributionRanker(Graph graph)
graph
- the graph whose nodes are to be ranked based on indegreepublic DegreeDistributionRanker(Graph graph, boolean useInDegree)
graph
- the graph whose nodes are to be ranked baseduseInDegree
- if true
, indicates indegree is to be used, if false
outdegreeprotected double evaluateIteration()
IterativeProcess
evaluateIteration
in class IterativeProcess
public java.lang.String getRankScoreKey()
AbstractRanker
getRankScoreKey
in class AbstractRanker