|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.uci.ics.jung.algorithms.util.IterativeProcess
edu.uci.ics.jung.algorithms.importance.AbstractRanker<V,E>
edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker<V,E>
public abstract class RelativeAuthorityRanker<V,E>
This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes. The services provided are:
| Field Summary | |
|---|---|
protected Map<V,Number> |
priorRankScoreMap
The default key used for the user datum key corresponding to prior rank scores. |
| Fields inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker |
|---|
edgeRankScores, vertexRankScores |
| Constructor Summary | |
|---|---|
RelativeAuthorityRanker()
|
|
| Method Summary | |
|---|---|
protected void |
finalizeIterations()
Cleans up all of the prior rank scores on finalize. |
protected double |
getPriorRankScore(V v)
Retrieves the value of the prior rank score. |
protected Set<V> |
getPriors()
Retrieves the set of priors. |
void |
setPriorRankScore(V v,
double value)
Allows the user to specify a value to set for the prior rank score |
protected void |
setPriors(Set<V> priors)
Specifies which vertices are root nodes (priors). |
| Methods inherited from class edu.uci.ics.jung.algorithms.util.IterativeProcess |
|---|
done, evaluate, getDesiredPrecision, getIterations, getMaximumIterations, getPrecision, hasConverged, initializeIterations, relativePrecision, setDesiredPrecision, setMaximumIterations, setPrecision, step |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected Map<V,Number> priorRankScoreMap
| Constructor Detail |
|---|
public RelativeAuthorityRanker()
| Method Detail |
|---|
protected void finalizeIterations()
finalizeIterations in class AbstractRanker<V,E>protected double getPriorRankScore(V v)
v - the root node (prior)
public void setPriorRankScore(V v,
double value)
v - the root node (prior)value - the score to set toprotected Set<V> getPriors()
protected void setPriors(Set<V> priors)
priors - the root nodes
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||