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

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

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

Subclasses of AbstractIterativeScorer in edu.uci.ics.jung.algorithms.scoring
 class AbstractIterativeScorerWithPriors<V,E,S>
          An abstract class for iterative random-walk-based vertex scoring algorithms that have a fixed probability, for each vertex, of 'jumping' to that vertex at each step in the algorithm (rather than following a link out of that vertex).
 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 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.
 class VoltageScorer<V,E>
          Assigns scores to vertices according to their 'voltage' in an approximate solution to the Kirchoff equations.
 



Copyright © 2008 null. All Rights Reserved.