Uses of Class
edu.uci.ics.jung.algorithms.importance.AbstractRanker
-
Packages that use AbstractRanker Package Description edu.uci.ics.jung.algorithms.importance -
-
Uses of AbstractRanker in edu.uci.ics.jung.algorithms.importance
Subclasses of AbstractRanker in edu.uci.ics.jung.algorithms.importance Modifier and Type Class Description class
BetweennessCentrality<V,E>
Computes betweenness centrality for each vertex and edge in the graph.class
KStepMarkov<V,E>
Algorithm variant ofPageRankWithPriors
that computes the importance of a node based upon taking fixed-length random walks out from the root set and then computing the stationary probability of being at each node.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.class
WeightedNIPaths<V,E>
This algorithm measures the importance of nodes based upon both the number and length of disjoint paths that lead to a given node from each of the nodes in the root set.
-