Uses of Class
edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker

Packages that use RelativeAuthorityRanker
edu.uci.ics.jung.algorithms.importance Provides a set of algorithms for computing the importance of each node (or edge) in a graph relative to all others (or, for the algorithms that inherit from RelativeAuthorityRanker, relative to a specified subset of elements). 
 

Uses of RelativeAuthorityRanker in edu.uci.ics.jung.algorithms.importance
 

Subclasses of RelativeAuthorityRanker in edu.uci.ics.jung.algorithms.importance
 class HITSWithPriors
          Algorithm that extends the HITS algorithm by incorporating root nodes (priors).
 class KStepMarkov
          Algorithm variant of PageRankWithPriors 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 MarkovCentrality
           
 class PageRank
          This algorithm measures the importance of a node in terms of the fraction of time spent at that node relative to all other nodes.
 class PageRankWithPriors
          Algorithm that extends the PageRank algorithm by incorporating root nodes (priors).