Package edu.uci.ics.jung.algorithms.importance

Class Summary
AbstractRanker<V,E> Abstract class for algorithms that rank nodes or edges by some "importance" metric.
BaryCenter<V,E> Deprecated. As of JUNG 2.0 beta, replaced with BarycenterScorer.
BetweennessCentrality<V,E> Computes betweenness centrality for each vertex and edge in the graph.
DegreeDistributionRanker<V,E> Deprecated. As of JUNG 2.0 beta, replaced with DegreeScorer.
HITS<V,E> Deprecated. As of JUNG 2.0 beta, replaced with HITS.
HITSWithPriors<V,E> Deprecated. As of JUNG 2.0 beta, replaced with HITSWithPriors.
KStepMarkov<V,E> 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.
MarkovCentrality<V,E>  
PageRank<V,E> Deprecated. As of JUNG 2.0 beta, replaced with PageRank.
PageRankWithPriors<V,E> Deprecated. As of JUNG 2.0 beta, replaced with PageRankWithPriors.
RandomWalkBetweenness<V,E> Computes betweenness centrality for each vertex in the graph.
RandomWalkSTBetweenness<V,E> /** Computes s-t betweenness centrality for each vertex in the graph.
Ranking<V> Abstract data container for ranking objects.
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.
VoltageRanker<V,E> Deprecated. As of JUNG 2.0 beta, replaced with VoltageScorer.
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.
 



Copyright © 2008 null. All Rights Reserved.