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

Packages that use IterativeContext
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. 
edu.uci.ics.jung.visualization3d.layout   
 

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 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 IterativeContext
 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 MarkovCentrality<V,E>
           
 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>
          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.
 

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)
          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 IterativeContext
 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.
 

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

Classes in edu.uci.ics.jung.algorithms.util that implement IterativeContext
 class IterativeProcess
          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 IterativeContext
 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.
 

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.jung.visualization3d.layout
 

Classes in edu.uci.ics.jung.visualization3d.layout that implement IterativeContext
 class LayoutEventBroadcaster<V,E>
          A LayoutDecorator the fires ChangeEvents when certain methods are called.
 



Copyright © 2009. All Rights Reserved.