...
The last phase of Mr. Tree is a simple edge-routing that simply connects the previously placed nodes directly.
MrTGraph Data Structure
The MrTGraph data structure is best explained by looking at the following diagram:
The basic data structure constis of the three classes TNode, TGraph and TEdge, which contain all the necessary properties to model a tree data structure. Therefore a TGraph consits of sets of TEdges and TNodes.
The TNodes are objects of the type TShape. That means that a nodes' size and position is defined by the attributes defined in the class TShape. The class TShape is an abstract superclass for the class TGraphElement. So the class TGrahpElement provides the utilites to declare any generic graph element of which a TGraph consits of.
...
Features
Mr.Tree is a layout algorithm that lays out a graph in a tree layout. It contains the following features:
...