Uses of Class
edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors

Packages that use AbstractIterativeScorerWithPriors
edu.uci.ics.jung.algorithms.scoring Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties. 
 

Uses of AbstractIterativeScorerWithPriors in edu.uci.ics.jung.algorithms.scoring
 

Subclasses of AbstractIterativeScorerWithPriors in edu.uci.ics.jung.algorithms.scoring
 class EigenvectorCentrality<V,E>
          Calculates eigenvector centrality for each vertex in the graph.
 class HITS<V,E>
          Assigns hub and authority scores to each vertex depending on the topology of the network.
 class HITSWithPriors<V,E>
          A generalization of HITS that permits non-uniformly-distributed random jumps.
 class KStepMarkov<V,E>
          A special case of PageRankWithPriors in which the final scores represent a probability distribution over position assuming a random (Markovian) walk of exactly k steps, based on the initial distribution specified by the priors.
 class PageRank<V,E>
          Assigns scores to each vertex according to the PageRank algorithm.
 class PageRankWithPriors<V,E>
          A generalization of PageRank that permits non-uniformly-distributed random jumps.
 



Copyright © 2011. All Rights Reserved.