Uses of Interface
edu.uci.ics.jung.graph.Forest
Packages that use Forest
Package
Description
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
Interfaces for the JUNG graph types, and some representative implementations.
Utility interfaces and classes for the JUNG API.
Sample applications created using JUNG, largely focused on visualization.
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 ForestConstructors in edu.uci.ics.jung.algorithms.layout with parameters of type ForestModifierConstructorDescriptionBalloonLayout
(Forest<V, E> g) Creates an instance based on the input forest.RadialTreeLayout
(Forest<V, E> g) RadialTreeLayout
(Forest<V, E> g, int distx) RadialTreeLayout
(Forest<V, E> g, int distx, int disty) 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 ForestMethods in edu.uci.ics.jung.algorithms.shortestpath that return ForestModifier and TypeMethodDescriptionMinimumSpanningForest.getForest()
MinimumSpanningForest2.getForest()
Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type ForestModifierConstructorDescriptionCreates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.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, com.google.common.base.Supplier<? extends Graph<V, E>> treeFactory, com.google.common.base.Function<? super 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 ForestModifierConstructorDescriptionMinimumSpanningForest
(Graph<V, E> graph, com.google.common.base.Supplier<Forest<V, E>> Supplier, V root, Map<E, Double> weights) Creates a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.MinimumSpanningForest2
(Graph<V, E> graph, com.google.common.base.Supplier<Forest<V, E>> supplier, com.google.common.base.Supplier<? extends Graph<V, E>> treeFactory, com.google.common.base.Function<? super E, Double> weights) Create a Forest from the supplied Graph and supplied Supplier, 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.graphModifier and TypeInterfaceDescriptioninterface
Tree<V,
E> A subtype ofGraph
which is a (directed, rooted) tree.Classes in edu.uci.ics.jung.graph that implement ForestModifier and TypeClassDescriptionclass
DelegateForest<V,
E> An implementation ofForest
that delegates to a specifiedDirectedGraph
instance.class
DelegateTree<V,
E> An implementation ofTree
that delegates to a specified instance ofDirectedGraph
.class
OrderedKAryTree<V,
E> An implementation ofTree
in which each vertex has ≤ k children. -
Uses of Forest in edu.uci.ics.jung.graph.util
Classes in edu.uci.ics.jung.graph.util that implement ForestModifier and TypeClassDescription(package private) static class
(package private) static class
(package private) static class
(package private) static class
Methods in edu.uci.ics.jung.graph.util with parameters of type ForestModifier and TypeMethodDescriptionstatic <V,
E> void TreeUtils.addFromSubTree
(Forest<V, E> tree, Forest<V, E> subTree, E edge, V parent, V root) static <V,
E> void TreeUtils.addSubTree
(Forest<V, E> tree, Forest<V, E> subTree, V node, E connectingEdge) ConnectssubTree
totree
by attaching it as a child ofnode
with edgeconnectingEdge
.static <V,
E> List <V> static <V,
E> Tree <V, E> TreeUtils.getSubTree
(Forest<V, E> forest, V root) Returns the subtree oftree
which is rooted atroot
as aForest
.static <V,
E> void TreeUtils.growSubTree
(Forest<V, E> tree, Forest<V, E> subTree, V root) Populatessubtree
with the subtree oftree
which is rooted atroot
.static <V,
E> Graphs.SynchronizedForest <V, E> Graphs.synchronizedForest
(Forest<V, E> forest) Returns a synchronized Forest backed by the passed Forest.static <V,
E> Graphs.UnmodifiableForest <V, E> Graphs.unmodifiableForest
(Forest<V, E> forest) Returns an unmodifiableForest
backed by the passed forest.Constructors in edu.uci.ics.jung.graph.util with parameters of type ForestModifierConstructorDescriptionSynchronizedForest
(Forest<V, E> delegate) Creates a new instance based on the provideddelegate
.private
UnmodifiableForest
(Forest<V, E> delegate) -
Uses of Forest in edu.uci.ics.jung.samples
Fields in edu.uci.ics.jung.samples declared as Forest -
Uses of Forest in edu.uci.ics.jung.visualization.subLayout
Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type Forest