|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
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.DegreeDistributionRanker<V,E>
DegreeScorer
.
public class DegreeDistributionRanker<V,E>
A simple node importance ranker based on the degree of the node. The user can specify whether s/he wants to use the indegree or the outdegree as the metric. If the graph is undirected this option is effectively ignored. So for example, if the graph is directed and the user chooses to use in-degree, nodes with the highest in-degree will be ranked highest and similarly nodes with the lowest in-degree will be ranked lowest.
A simple example of usage is:
DegreeDistributionRanker ranker = new DegreeDistributionRanker(someGraph); ranker.evaluate(); ranker.printRankings();
Field Summary | |
---|---|
static String |
KEY
Deprecated. |
Fields inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker |
---|
edgeRankScores, vertexRankScores |
Constructor Summary | |
---|---|
DegreeDistributionRanker(Graph<V,E> graph)
Deprecated. Default constructor which assumes if the graph is directed the indegree is to be used. |
|
DegreeDistributionRanker(Graph<V,E> graph,
boolean useInDegree)
Deprecated. This constructor allows you to specify whether to use indegree or outdegree. |
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.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 |
Field Detail |
---|
public static final String KEY
Constructor Detail |
---|
public DegreeDistributionRanker(Graph<V,E> graph)
graph
- the graph whose nodes are to be ranked based on indegreepublic DegreeDistributionRanker(Graph<V,E> graph, boolean useInDegree)
graph
- the graph whose nodes are to be ranked baseduseInDegree
- if true
, indicates indegree is to be used, if false
outdegreeMethod Detail |
---|
public void step()
IterativeProcess
step
in interface IterativeContext
step
in class IterativeProcess
public String getRankScoreKey()
AbstractRanker
getRankScoreKey
in class AbstractRanker<V,E>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |