Uses of Interface
edu.uci.ics.jung.graph.Forest

Packages that use Forest

edu.uci.ics.jung.algorithms.layout	Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.shortestpath	Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
edu.uci.ics.jung.graph	Interfaces for the JUNG graph types, and some representative implementations.
edu.uci.ics.jung.graph.util	Utility interfaces and classes for the JUNG API.
edu.uci.ics.jung.visualization.subLayout	Visualization mechanisms relating to grouping or hiding specified element sets.

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

Fields in edu.uci.ics.jung.algorithms.layout declared as Forest

protected Forest<V,E>

TreeLayout.graph

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

BalloonLayout(Forest<V,E> g)
Creates an instance based on the input forest.

RadialTreeLayout(Forest<V,E> g)
Creates an instance for the specified graph with default X and Y distances.

RadialTreeLayout(Forest<V,E> g, int distx)
Creates an instance for the specified graph and X distance with default Y distance.

RadialTreeLayout(Forest<V,E> g, int distx, int disty)
Creates an instance for the specified graph, X distance, and Y distance.

TreeLayout(Forest<V,E> g)
Creates an instance for the specified graph with default X and Y distances.

TreeLayout(Forest<V,E> g, int distx)
Creates an instance for the specified graph and X distance with default Y distance.

TreeLayout(Forest<V,E> g, int distx, int disty)
Creates an instance for the specified graph, X distance, and Y distance.

Uses of Forest in edu.uci.ics.jung.algorithms.shortestpath

Fields in edu.uci.ics.jung.algorithms.shortestpath declared as Forest

protected Forest<V,E>	MinimumSpanningForest2.forest
protected Forest<V,E>	MinimumSpanningForest.forest

Methods in edu.uci.ics.jung.algorithms.shortestpath that return Forest

Forest<V,E>	MinimumSpanningForest2.getForest() Returns the generated forest.
Forest<V,E>	MinimumSpanningForest.getForest() Returns the generated forest.

Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Forest

MinimumSpanningForest(Graph<V,E> graph, Forest<V,E> forest, V root)
Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.

MinimumSpanningForest(Graph<V,E> graph, Forest<V,E> forest, V root, Map<E,Double> weights)
Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.

MinimumSpanningForest2(Graph<V,E> graph, Forest<V,E> forest, org.apache.commons.collections15.Factory<? extends Graph<V,E>> treeFactory, org.apache.commons.collections15.Transformer<E,Double> weights)
create a forest from the supplied graph, populating the supplied Forest, which must be empty.

Constructor parameters in edu.uci.ics.jung.algorithms.shortestpath with type arguments of type Forest

MinimumSpanningForest(Graph<V,E> graph, org.apache.commons.collections15.Factory<Forest<V,E>> factory, V root, Map<E,Double> weights)
Creates a Forest from the supplied Graph and supplied Factory, which is used to create a new, empty Forest.

MinimumSpanningForest2(Graph<V,E> graph, org.apache.commons.collections15.Factory<Forest<V,E>> factory, org.apache.commons.collections15.Factory<? extends Graph<V,E>> treeFactory, org.apache.commons.collections15.Transformer<E,Double> weights)
create a Forest from the supplied Graph and supplied Factory, which is used to create a new, empty Forest.

Uses of Forest in edu.uci.ics.jung.graph

Subinterfaces of Forest in edu.uci.ics.jung.graph

interface

Tree<V,E> A subtype of Graph which is a (directed, rooted) tree.

Classes in edu.uci.ics.jung.graph that implement Forest

class	DelegateForest<V,E> An implementation of Forest that delegates to a specified DirectedGraph instance.
class	DelegateTree<V,E> An implementation of Tree that delegates to a specified instance of DirectedGraph.
class	OrderedKAryTree<V,E> An implementation of Tree in which each vertex has <= k children.

Uses of Forest in edu.uci.ics.jung.graph.util

Methods in edu.uci.ics.jung.graph.util with parameters of type Forest

static <V,E> void	TreeUtils.addFromSubTree(Forest<V,E> tree, Forest<V,E> subTree, E edge, V parent, V root) Adds the trees in source to destination.
static <V,E> void	TreeUtils.addFromSubTree(Forest<V,E> tree, Forest<V,E> subTree, E edge, V parent, V root) Adds the trees in source to destination.
static <V,E> void	TreeUtils.addSubTree(Forest<V,E> tree, Forest<V,E> subTree, V node, E connectingEdge) Connects subTree to tree by attaching it as a child of node with edge connectingEdge.
static <V,E> void	TreeUtils.addSubTree(Forest<V,E> tree, Forest<V,E> subTree, V node, E connectingEdge) Connects subTree to tree by attaching it as a child of node with edge connectingEdge.
static <V,E> List<V>	TreeUtils.getRoots(Forest<V,E> forest) Returns the roots of this forest.
static <V,E> Tree<V,E>	TreeUtils.getSubTree(Forest<V,E> forest, V root) Returns the subtree of tree which is rooted at root as a Forest.
static <V,E> void	TreeUtils.growSubTree(Forest<V,E> tree, Forest<V,E> subTree, V root) Populates subtree with the subtree of tree which is rooted at root.
static <V,E> void	TreeUtils.growSubTree(Forest<V,E> tree, Forest<V,E> subTree, V root) Populates subtree with the subtree of tree which is rooted at root.
static <V,E> edu.uci.ics.jung.graph.util.Graphs.SynchronizedForest<V,E>	Graphs.synchronizedForest(Forest<V,E> forest) Returns a synchronized Forest backed by the passed Forest.
static <V,E> edu.uci.ics.jung.graph.util.Graphs.UnmodifiableForest<V,E>	Graphs.unmodifiableForest(Forest<V,E> forest) Returns an unmodifiable Forest backed by the passed forest.

Uses of Forest in edu.uci.ics.jung.visualization.subLayout

Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type Forest

void	TreeCollapser.collapse(Layout layout, Forest tree, Object subRoot)
void	TreeCollapser.expand(Forest tree, Forest subTree)
void	TreeCollapser.expand(Forest tree, Forest subTree)