edu.uci.ics.jung.algorithms.importance
Class BaryCenter<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.BaryCenter<V,E>
- All Implemented Interfaces:
- IterativeContext
Deprecated. As of JUNG 2.0 beta, replaced with BarycenterScorer
.
public class BaryCenter<V,E>
- extends AbstractRanker<V,E>
A simple node importance ranker based on the total shortest path of the
node. More central nodes in a connected component will have smaller
overall shortest paths, and 'peripheral' nodes on the network will have
larger overall shortest paths. Runing this ranker on a graph with more
than one connected component will arbitarily mix nodes from both
components. For this reason you should probably run this ranker on one
component only (but that goes for all rankers).
A simple example of usage is:
BaryCenter ranker = new BaryCenter(someGraph);
ranker.evaluate();
ranker.printRankings();
- Author:
- Dan Bolser, Scott White
Constructor Summary |
BaryCenter(Graph<V,E> g)
Deprecated. Constructor which initializes the algorithm |
Method Summary |
String |
getRankScoreKey()
Deprecated. The user datum key used to store the rank score. |
void |
step()
Deprecated. Evaluate the result of the current iteration. |
Methods inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker |
assignDefaultEdgeTransitionWeights, finalizeIterations, getEdgeRankScore, getEdgeRankScore, getEdgeRankScores, getEdgeRankScores, getEdgeWeight, getEdgeWeights, getGraph, getRankings, getRankScores, getVertexCount, getVertexRankScore, 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, getStatus, hasConverged, initializeIterations, relativePrecision, setDesiredPrecision, setMaximumIterations, setPrecision |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
KEY
public static final String KEY
- Deprecated.
- See Also:
- Constant Field Values
BaryCenter
public BaryCenter(Graph<V,E> g)
- Deprecated.
- Constructor which initializes the algorithm
- Parameters:
g
- the graph whose nodes are to be analyzed
step
public void step()
- Deprecated.
- Description copied from class:
IterativeProcess
- Evaluate the result of the current iteration.
- Specified by:
step
in interface IterativeContext
- Specified by:
step
in class IterativeProcess
getRankScoreKey
public String getRankScoreKey()
- Deprecated.
- Description copied from class:
AbstractRanker
- The user datum key used to store the rank score.
- Specified by:
getRankScoreKey
in class AbstractRanker<V,E>
- Returns:
- the key
Copyright © 2008 null. All Rights Reserved.