Uses of Package
edu.uci.ics.jung.algorithms

Packages that use edu.uci.ics.jung.algorithms

edu.uci.ics.jung.algorithms	Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways.
edu.uci.ics.jung.algorithms.flows	Provides a series of methods for solving the s-t max flow and other network flow problems.
edu.uci.ics.jung.algorithms.importance	Provides a set of algorithms for computing the importance of each node (or edge) in a graph relative to all others (or, for the algorithms that inherit from RelativeAuthorityRanker, relative to a specified subset of elements).
scratch.scott
scratch.scott.optimization	Provides a set of general optimization algorithms that can be used towards network problems.

Classes in edu.uci.ics.jung.algorithms used by edu.uci.ics.jung.algorithms

MatrixElementOperations
An interface for specifying the behavior of graph/matrix operations for a particular element type.

Classes in edu.uci.ics.jung.algorithms used by edu.uci.ics.jung.algorithms.flows

IterativeProcess
Provides basic infrastructure for iterative algorithms.

Classes in edu.uci.ics.jung.algorithms used by edu.uci.ics.jung.algorithms.importance

IterativeProcess
Provides basic infrastructure for iterative algorithms.

Classes in edu.uci.ics.jung.algorithms used by scratch.scott

IterativeProcess
Provides basic infrastructure for iterative algorithms.

Classes in edu.uci.ics.jung.algorithms used by scratch.scott.optimization

IterativeProcess
Provides basic infrastructure for iterative algorithms.