Uses of Interface
edu.uci.ics.jung.algorithms.scoring.VertexScorer

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

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

Classes in edu.uci.ics.jung.algorithms.scoring that implement VertexScorer
 class AbstractIterativeScorer<V,E,T>
          An abstract class for algorithms that assign scores to vertices based on iterative methods.
 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 BarycenterScorer<V,E>
          Assigns scores to each vertex according to the sum of its distances to all other vertices.
 class BetweennessCentrality<V,E>
          Computes betweenness centrality for each vertex and edge in the graph.
 class ClosenessCentrality<V,E>
          Assigns scores to each vertex based on the mean distance to each other vertex.
 class DegreeScorer<V>
          Assigns a score to each vertex equal to its degree.
 class DistanceCentralityScorer<V,E>
          Assigns scores to vertices based on their distances to each other vertex in the graph.
 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.
 class VoltageScorer<V,E>
          Assigns scores to vertices according to their 'voltage' in an approximate solution to the Kirchoff equations.
 

Uses of VertexScorer in edu.uci.ics.jung.algorithms.scoring.util
 

Fields in edu.uci.ics.jung.algorithms.scoring.util declared as VertexScorer
protected  VertexScorer<V,S> VertexScoreTransformer.vs
          The VertexScorer instance that provides the values returned by transform.
 

Constructors in edu.uci.ics.jung.algorithms.scoring.util with parameters of type VertexScorer
VertexScoreTransformer(VertexScorer<V,S> vs)
          Creates an instance based on the specified VertexScorer.
 



Copyright © 2011. All Rights Reserved.