Package org.jungrapht.visualization.layout.algorithms

Interface TreeLayout<V>

Type Parameters:

V -

All Superinterfaces:

AfterRunnable, Consumer<Function<V,Rectangle>>, LayoutAlgorithm<V>, VertexBoundsFunctionConsumer<V>

All Known Subinterfaces:

RadialTreeLayout<V>

All Known Implementing Classes:

AbstractTreeLayoutAlgorithm, BalloonLayoutAlgorithm, EdgeAwareTreeLayoutAlgorithm, MultiRowEdgeAwareTreeLayoutAlgorithm, MultiRowTreeLayoutAlgorithm, RadialEdgeAwareTreeLayoutAlgorithm, RadialTreeLayoutAlgorithm, TidierRadialTreeLayoutAlgorithm, TidierTreeLayoutAlgorithm, TreeLayoutAlgorithm

public interface TreeLayout<V>
extends LayoutAlgorithm<V>, VertexBoundsFunctionConsumer<V>

an interface for LayoutAlgorithm that place their vertices in a tree like heirarchy

Nested Class Summary

Nested classes/interfaces inherited from interface org.jungrapht.visualization.layout.algorithms.LayoutAlgorithm

LayoutAlgorithm.Builder<V,T extends LayoutAlgorithm<V>,B extends LayoutAlgorithm.Builder<V,T,B>>, LayoutAlgorithm.NoOp<V>

Field Summary

Fields

Modifier and Type	Field	Description
static int	TREE_LAYOUT_HORIZONTAL_SPACING
static int	TREE_LAYOUT_VERTICAL_SPACING

Method Summary

Modifier and Type	Method	Description
Map<V,Rectangle>	getBaseBounds()
static <V,E> boolean	isIsolatedVertex(org.jgrapht.Graph<V,E> graph, V v)
static <V,E> boolean	isLoopVertex(org.jgrapht.Graph<V,E> graph, V v)
static <V,E> boolean	isZeroDegreeVertex(org.jgrapht.Graph<V,E> graph, V v)
void	setRootComparator(Comparator<V> rootComparator)
void	setRootPredicate(Predicate<V> rootPredicate)
static <V,E> int	vertexIsolationScore(org.jgrapht.Graph<V,E> graph, V v)	to set vertex order to normal -> loop -> zeroDegree

Methods inherited from interface org.jungrapht.visualization.layout.algorithms.util.AfterRunnable

runAfter, setAfter

Methods inherited from interface java.util.function.Consumer

andThen

Methods inherited from interface org.jungrapht.visualization.layout.algorithms.LayoutAlgorithm

cancel, constrained, visit

Methods inherited from interface org.jungrapht.visualization.layout.algorithms.util.VertexBoundsFunctionConsumer

accept, setVertexBoundsFunction

Field Detail

TREE_LAYOUT_HORIZONTAL_SPACING

static final int TREE_LAYOUT_HORIZONTAL_SPACING

TREE_LAYOUT_VERTICAL_SPACING

static final int TREE_LAYOUT_VERTICAL_SPACING

Method Detail

getBaseBounds

Map<V,Rectangle> getBaseBounds()

setRootPredicate

void setRootPredicate(Predicate<V> rootPredicate)

setRootComparator

void setRootComparator(Comparator<V> rootComparator)

isLoopVertex

static <V,E> boolean isLoopVertex(org.jgrapht.Graph<V,E> graph,
                                        V v)

isZeroDegreeVertex

static <V,E> boolean isZeroDegreeVertex(org.jgrapht.Graph<V,E> graph,
                                              V v)

isIsolatedVertex

static <V,E> boolean isIsolatedVertex(org.jgrapht.Graph<V,E> graph,
                                            V v)

vertexIsolationScore

static <V,E> int vertexIsolationScore(org.jgrapht.Graph<V,E> graph,
                                            V v)

to set vertex order to normal -> loop -> zeroDegree

Type Parameters:

V -

E -

Parameters:

graph -

v -

Returns: