Package org.graffiti.plugins.algorithms.reingoldtilford

Contains an implementation of the extended Reingold-Tilford algorithm which hierarchically lays out a rooted tree of unbounded degree and with arbitrary node sizes.

See:
          Description

Interface Summary
ChildOrderStrategy Defines an interface for classes that know how to combine the tree layout of siblings.
ContourNodeIterator Defines an interface for classes that act as iterators pointing to a contour node in a ContourNodeList or to null.
EdgeLayoutStrategy Defines an interface for classes that know how to lay out edges connecting a node with its subtrees.
ParentPlacementStrategy Defines an interface for classes that know how to calculate the horizontal placement of Nodes above their children.
TreeVisitor<T> Classes implementing TreeVisitor perform some task on a Tree layout.
 

Class Summary
AllPermutationsChildOrderStrategy Tries all possible permutations of children to minimize the width of the tree layout.
BestFitDecreaseChildOrderStrategy Tries to minimize the width of the tree layout by succesively adding the child that respectively contributes least to an increase of the TreeCombinationStack.
BestInsertionChildOrderStrategy Tries to minimize the width of the tree by successively inserting the children into a TreeCombinationList at the position that respectively yields in the minimal width of the list.
BottomCenterToTopCenterEdgeLayoutStrategy Lays the edges so that each edge leaves the parent at the center of the bottom side and enters the child at the center of the top side.
BubbleSortChildOrderStrategy Tries to minimize the width of the tree by inserting all children into a TreeCombinationList and then reducing the width by repeatedly swaping trees in the list.
BusEdgeLayoutStrategy Lays the edges reminiscent of a bus layout.
CenterToCenterEdgeLayoutStrategy Lays the edges in a straight line between the parent and the respective child.
ContourNodeList Subclasses of ContourNodeList represent contour lines of tree layouts.
LevellingStrategy Subclasses of LevellingStrategy define at which y-coordinate each Node is placed.
OrientationStrategy Subclasses of OrientationStrategy determine the orientation of a tree.
ReingoldTilfordAlgorithm ReingoldTilfordAlgorithm implements an extended version of the Reingold-Tilford algorithm, which hierarchically lays out a rooted tree of unbounded degree and with arbitrary node sizes.
ReingoldTilfordPlugin Provides a Reingold-Tilford algorithm.
TranslatedContourNodeList A ContourNodeList, which is constructed from another ContourNodeList in order to achieve vertical distance constraints of tree layouts.
Tree Represents a tree layout of a subtree.
TreeCombinationList TreeCombinationList is used to compose a Tree layout from the layouts of its children.
TreeCombinationStack TreeCombinationStack is used to compose a Tree layout from the layouts of its children.
 

Enum Summary
LevellingPolicy LevellingPolicy determines the y-coordinate at which each Node is placed.
Orientation The orientation of a tree layout.
 

Exception Summary
LockedTreeException This exception is thrown when one tries to flip a Tree or add it to a TreeCombinationStack or TreeCombinationList although it or its flipped counterpart is currently contained in such a stack or list.
 

Package org.graffiti.plugins.algorithms.reingoldtilford Description

Contains an implementation of the extended Reingold-Tilford algorithm which hierarchically lays out a rooted tree of unbounded degree and with arbitrary node sizes.

Throughout this package, the terms 'width' and 'height' of (sub)trees refer to dimensions of the tree layout rather than graph-theoretic properties.

See Also:
ReingoldTilfordAlgorithm


Generated at 2012-05-30 11:01:25 PM CEST