Uses of Interface
edu.uci.ics.jung.algorithms.util.IterativeContext
Packages that use IterativeContext
Package
Description
Methods for calculating properties relating to network flows (such as max flow/min cut).
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
Utility classes for updating layout positions.
Mechanisms for assigning values (denoting significance, influence, centrality, etc.)
to graph elements based on topological properties.
Provides general algorithmic utilities.
Visualization mechanisms related to graph layout: caching, persistence,
event-emitting, etc.
Utilities for graph visualization.
-
Uses of IterativeContext in edu.uci.ics.jung.algorithms.flows
Classes in edu.uci.ics.jung.algorithms.flows that implement IterativeContextModifier and TypeClassDescriptionclass
EdmondsKarpMaxFlow<V,
E> Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem. -
Uses of IterativeContext in edu.uci.ics.jung.algorithms.importance
Classes in edu.uci.ics.jung.algorithms.importance that implement IterativeContextModifier and TypeClassDescriptionclass
AbstractRanker<V,
E> Abstract class for algorithms that rank nodes or edges by some "importance" metric.class
Computes betweenness centrality for each vertex and edge in the graph.class
KStepMarkov<V,
E> Algorithm variant ofPageRankWithPriors
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
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. -
Uses of IterativeContext in edu.uci.ics.jung.algorithms.layout
Classes in edu.uci.ics.jung.algorithms.layout that implement IterativeContextModifier and TypeClassDescriptionclass
AggregateLayout<V,
E> ALayout
implementation that combines multiple other layouts so that they may be manipulated as one layout.class
DAGLayout<V,
E> An implementation ofLayout
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. -
Uses of IterativeContext in edu.uci.ics.jung.algorithms.layout.util
Fields in edu.uci.ics.jung.algorithms.layout.util declared as IterativeContextConstructors in edu.uci.ics.jung.algorithms.layout.util with parameters of type IterativeContextModifierConstructorDescriptionVisRunner
(IterativeContext process) Creates an instance for the specified process. -
Uses of IterativeContext in edu.uci.ics.jung.algorithms.scoring
Classes in edu.uci.ics.jung.algorithms.scoring that implement IterativeContextModifier and TypeClassDescriptionclass
AbstractIterativeScorer<V,
E, T> An abstract class for algorithms that assign scores to vertices based on iterative methods.class
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
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 ofPageRankWithPriors
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 IterativeContext in edu.uci.ics.jung.algorithms.util
Classes in edu.uci.ics.jung.algorithms.util that implement IterativeContextModifier and TypeClassDescriptionclass
Provides basic infrastructure for iterative algorithms. -
Uses of IterativeContext in edu.uci.ics.jung.visualization.layout
Classes in edu.uci.ics.jung.visualization.layout that implement IterativeContextModifier and TypeClassDescriptionclass
CachingLayout<V,
E> A LayoutDecorator that caches locations in a clearable Map.class
LayoutTransition<V,
E> class
A LayoutDecorator that fires ChangeEvents when certain methods are called.class
PersistentLayoutImpl<V,
E> Implementation of PersistentLayout. -
Uses of IterativeContext in edu.uci.ics.jung.visualization.util
Fields in edu.uci.ics.jung.visualization.util declared as IterativeContextConstructors in edu.uci.ics.jung.visualization.util with parameters of type IterativeContextModifierConstructorDescriptionAnimator
(IterativeContext process) Animator
(IterativeContext process, long sleepTime)