Package edu.uci.ics.jung.algorithms.scoring

Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties. These include:
  • BarycenterScorer: assigns a score to each vertex according to the sum of the distances to all other vertices
  • ClosenessCentrality: assigns a score to each vertex based on the mean distance to each other vertex
  • DegreeScorer: assigns a score to each vertex based on its degree
  • EigenvectorCentrality: assigns vertex scores based on long-term probabilities of random walks passing through the vertex at time t
  • PageRank: like EigenvectorCentrality, but with a constant probability of the random walk restarting at a uniform-randomly chosen vertex
  • PageRankWithPriors: like PageRank, but with a constant probability of the random walk restarting at a vertex drawn from an arbitrary distribution
  • HITS: assigns hubs-and-authorities scores to vertices based on complementary random walk processes
  • HITSWithPriors: analogous to HITS (see PageRankWithPriors)
  • VoltageScorer: assigns scores to vertices based on simulated current flow along edges