Orthogonal tree drawing


Functions

void abstractMixedGraph::Layout_KandinskyTree (TNode root=NoNode, TFloat spacing=0.0) throw (ERRejected)
bool abstractMixedGraph::Layout_HorizontalVerticalTree (TNode root=NoNode, TFloat spacing=0.0) throw (ERRejected)

Function Documentation

bool Layout_HorizontalVerticalTree (  TNode  root = NoNode,
TFloat  spacing = 0.0
)  throw (ERRejected) [inherited]
 

Draw a binary tree bend-free in the small node orthogonal model.

Parameters:
root The node in the upper left corner
spacing The minimum distance between two nodes
Return values:
true If the predecessor arcs form a binary tree
This produces so-called HV-drawing of binary trees, where is every node is placed atop and/or left-hand of its descendants. That is, subtree root nodes are displayed in the upper left corner of the tight subtree bounding box.

The root node is defined by the predecessor labels if those exist, and then must the unique node without a predecessor arc. If no predecessor labels are at hand, a BFS search from the given root node is performed. If this is undefined, a degree 2 node is determined or, if non-existing, a degree 1 node, and used as the BFS root. The tree is exported by the predecessor labels then.

void Layout_KandinskyTree (  TNode  root = NoNode,
TFloat  spacing = 0.0
)  throw (ERRejected) [inherited]
 

Draw a rooted tree in the one-bent Kandinsky model.

Parameters:
root The node in the upper left corner
spacing The minimum distance between two nodes