Uses of Interface
edu.uci.ics.jung.algorithms.IterativeContext

Packages that use IterativeContext

edu.uci.ics.jung.algorithms
edu.uci.ics.jung.algorithms.flows
edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.layout
edu.uci.ics.jung.algorithms.layout.util
edu.uci.ics.jung.algorithms.scoring
edu.uci.ics.jung.visualization.layout
edu.uci.ics.jung.visualization.util
edu.uci.ics.jung3d.visualization.layout

Uses of IterativeContext in edu.uci.ics.jung.algorithms

Classes in edu.uci.ics.jung.algorithms that implement IterativeContext

class

IterativeProcess Provides basic infrastructure for iterative algorithms.

Uses of IterativeContext in edu.uci.ics.jung.algorithms.flows

Classes in edu.uci.ics.jung.algorithms.flows that implement IterativeContext

class

EdmondsKarpMaxFlow<V,E> Implements the EdmondsKarpMaxFlow 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 IterativeContext

class	AbstractRanker<V,E> Abstract class for algorithms that rank nodes or edges by some "importance" metric.
class	BaryCenter<V,E> A simple node importance ranker based on the total shortest path of the node.
class	BetweennessCentrality<V,E> Computes betweenness centrality for each vertex and edge in the graph.
class	DegreeDistributionRanker<V,E> A simple node importance ranker based on the degree of the node.
class	HITS<V,E> Calculates the "hubs-and-authorities" importance measures for each node in a graph.
class	HITSWithPriors<V,E> Algorithm that extends the HITS algorithm by incorporating root nodes (priors).
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	MarkovCentrality<V,E>
class	PageRank<V,E> This algorithm measures the importance of a node in terms of the fraction of time spent at that node relative to all other nodes.
class	PageRankWithPriors<V,E> Algorithm that extends the PageRank algorithm by incorporating root nodes (priors).
class	RandomWalkBetweenness<V,E> Computes betweenness centrality for each vertex in the graph.
class	RandomWalkSTBetweenness<V,E> /** Computes s-t betweenness centrality for each vertex in the graph.
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.

Uses of IterativeContext in edu.uci.ics.jung.algorithms.layout

Classes in edu.uci.ics.jung.algorithms.layout that implement IterativeContext

class	AggregateLayout<V,E> Allows multiple layouts to be combined and manipulated as one layout.
class	DAGLayout<V,E>
class	FRLayout<V,E> Implements the Fruchterman-Reingold algorithm for node layout.
class	FRLayout2<V,E> an attempt to optimize the FRLayout algorithm Implements the Fruchterman-Reingold 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 IterativeContext

protected IterativeContext

VisRunner.process

Constructors in edu.uci.ics.jung.algorithms.layout.util with parameters of type IterativeContext

VisRunner(IterativeContext process)

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

Classes in edu.uci.ics.jung.algorithms.scoring that implement IterativeContext

class	AbstractIterativeScorer<V,E,T>
class	AbstractIterativeScorerWithPriors<V,E,T>
class	EigenvectorCentrality<V,E>

Uses of IterativeContext in edu.uci.ics.jung.visualization.layout

Classes in edu.uci.ics.jung.visualization.layout that implement IterativeContext

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.

Uses of IterativeContext in edu.uci.ics.jung.visualization.util

Fields in edu.uci.ics.jung.visualization.util declared as IterativeContext

protected IterativeContext

Animator.process

Constructors in edu.uci.ics.jung.visualization.util with parameters of type IterativeContext

Animator(IterativeContext process)

Animator(IterativeContext process, long sleepTime)

Uses of IterativeContext in edu.uci.ics.jung3d.visualization.layout

Classes in edu.uci.ics.jung3d.visualization.layout that implement IterativeContext

class

LayoutEventBroadcaster<V,E> A LayoutDecorator the fires ChangeEvents when certain methods are called.