Package | Description |
---|---|
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.
|
Class and Description |
---|
AbstractIterativeScorer
An abstract class for algorithms that assign scores to vertices based on iterative methods.
|
AbstractIterativeScorerWithPriors
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).
|
DistanceCentralityScorer
Assigns scores to vertices based on their distances to each other vertex
in the graph.
|
EdgeScorer
An interface for algorithms that assign scores to edges.
|
HITS.Scores
Maintains hub and authority score information for a vertex.
|
HITSWithPriors
A generalization of HITS that permits non-uniformly-distributed random jumps.
|
PageRank
Assigns scores to each vertex according to the PageRank algorithm.
|
PageRankWithPriors
A generalization of PageRank that permits non-uniformly-distributed random jumps.
|
VertexScorer
An interface for algorithms that assign scores to vertices.
|
Class and Description |
---|
HITS.Scores
Maintains hub and authority score information for a vertex.
|
VertexScorer
An interface for algorithms that assign scores to vertices.
|
Copyright © 2015. All rights reserved.