Uses of Interface
org.jungrapht.visualization.layout.algorithms.util.VertexBoundsFunctionConsumer

Packages that use VertexBoundsFunctionConsumer

Package	Description
org.jungrapht.samples.sugiyama.test.algorithms
org.jungrapht.visualization.layout.algorithms	Support for graph layout algorithms

Uses of VertexBoundsFunctionConsumer in org.jungrapht.samples.sugiyama.test.algorithms

Classes in org.jungrapht.samples.sugiyama.test.algorithms that implement VertexBoundsFunctionConsumer

Modifier and Type	Class	Description
class	BrandesKopfLayoutAlgorithm<V,E>	Test only, as this class is hard-coded for a specific test graph
class	LayeredLayoutAlgorithm<V,E>	Test only, as this class is hard-coded for a specific test graph
class	TestEiglspergerLayoutAlgorithm<V,E>	Test only, as this class is hard-coded for a specific test graph
class	TestSugiyamaLayoutAlgorithm<V,E>	Test only, as this class is hard-coded for a specific test graph

Uses of VertexBoundsFunctionConsumer in org.jungrapht.visualization.layout.algorithms

Subinterfaces of VertexBoundsFunctionConsumer in org.jungrapht.visualization.layout.algorithms

Modifier and Type	Interface	Description
interface	RadialTreeLayout<V>	a marker interface for Tree layouts in a radial pattern
interface	TreeLayout<V>	an interface for LayoutAlgorithm that place their vertices in a tree like heirarchy

Classes in org.jungrapht.visualization.layout.algorithms that implement VertexBoundsFunctionConsumer

Modifier and Type	Class	Description
class	AbstractHierarchicalMinCrossLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
class	AbstractTreeLayoutAlgorithm<V>	A base class for tree layout algorithms.
class	BalloonLayoutAlgorithm<V>	A Layout implementation that assigns positions to Tree or Graph vertices using associations with nested circles ("balloons").
class	EdgeAwareTreeLayoutAlgorithm<V,E>	A TreeLayoutAlgorithm that can evaluate Comparator and Predicate for both edges and vertices.
class	EiglspergerLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
class	ForceAtlas2LayoutAlgorithm<V>	Implementation of ForceAtlas2 algorithm.
class	HierarchicalMinCrossLayoutAlgorithm<V,E>	A Hierarchical Minimum-Cross layout algorithm based on Sugiyama.
class	MultiRowEdgeAwareTreeLayoutAlgorithm<V,E>	A Multi-Row TreeLayoutAlgorithm that can be modified with comparators and predicates for both vertices and edges
class	MultiRowTreeLayoutAlgorithm<V>	A TreeLayoutAlgorithm that adheres to either an original width or to the width of the widest subtree in the forest by creating new rows of tree roots
class	RadialEdgeAwareTreeLayoutAlgorithm<V,E>	A radial layout for Tree or Forest graphs.
class	RadialTreeLayoutAlgorithm<V>	A radial layout for Tree or Forest graphs.
class	SugiyamaLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
class	TidierRadialTreeLayoutAlgorithm<V,E>	A radial layout for Tree or Forest graphs.
class	TidierTreeLayoutAlgorithm<V,E>	A more compact tree layout algorithm.
class	TreeLayoutAlgorithm<V>	A simple tree layout algorithm that will allow multiple roots.