Package | Description |
---|---|
edu.uci.ics.jung.algorithms.flows |
Methods for calculating properties relating to network flows (such as max flow/min cut).
|
edu.uci.ics.jung.algorithms.importance | |
edu.uci.ics.jung.algorithms.layout |
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
|
edu.uci.ics.jung.algorithms.layout.util |
Utility classes for updating layout positions.
|
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.util |
Provides general algorithmic utilities.
|
edu.uci.ics.jung.visualization.layout |
Visualization mechanisms related to graph layout: caching, persistence,
event-emitting, etc.
|
edu.uci.ics.jung.visualization.util |
Utilities for graph visualization.
|
Modifier and Type | Class and Description |
---|---|
class |
EdmondsKarpMaxFlow<V,E>
Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractRanker<V,E>
Abstract class for algorithms that rank nodes or edges by some "importance" metric.
|
class |
BetweennessCentrality<V,E>
Computes betweenness centrality for each vertex and edge in the graph.
|
class |
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. |
class |
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.
|
class |
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.
|
Modifier and Type | Class and Description |
---|---|
class |
AggregateLayout<V,E>
A
Layout implementation that combines
multiple other layouts so that they may be manipulated
as one layout. |
class |
DAGLayout<V,E>
An implementation of
Layout suitable for tree-like directed
acyclic graphs. |
class |
FRLayout<V,E>
Implements the Fruchterman-Reingold force-directed algorithm for node layout.
|
class |
FRLayout2<V,E>
Implements the Fruchterman-Reingold force-directed algorithm for node layout.
|
class |
ISOMLayout<V,E>
Implements a self-organizing map layout algorithm, based on Meyer's
self-organizing graph methods.
|
class |
KKLayout<V,E>
Implements the Kamada-Kawai algorithm for node layout.
|
class |
LayoutDecorator<V,E>
a pure decorator for the Layout interface.
|
class |
SpringLayout<V,E>
The SpringLayout package represents a visualization of a set of nodes.
|
class |
SpringLayout2<V,E>
The SpringLayout package represents a visualization of a set of nodes.
|
Modifier and Type | Field and Description |
---|---|
protected IterativeContext |
VisRunner.process |
Constructor and Description |
---|
VisRunner(IterativeContext process)
Creates an instance for the specified process.
|
Modifier and Type | Class and Description |
---|---|
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 |
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.
|
Modifier and Type | Class and Description |
---|---|
class |
IterativeProcess
Provides basic infrastructure for iterative algorithms.
|
Modifier and Type | Class and Description |
---|---|
class |
CachingLayout<V,E>
A LayoutDecorator that caches locations in a clearable Map.
|
class |
LayoutTransition<V,E> |
class |
ObservableCachingLayout<V,E>
A LayoutDecorator that fires ChangeEvents when certain methods
are called.
|
class |
PersistentLayoutImpl<V,E>
Implementation of PersistentLayout.
|
Modifier and Type | Field and Description |
---|---|
protected IterativeContext |
Animator.process |
Constructor and Description |
---|
Animator(IterativeContext process) |
Animator(IterativeContext process,
long sleepTime) |
Copyright © 2015. All rights reserved.