This page describes the main phases of the Mr. Tree. A short overview of all processors that operate in between these phases can be found here.
Phase 1:
...
Treeifying
This phase should create a tree, if a graph is hardly a tree.
...
This phase orders the nodes of each level by separating the children of nodes into leaves and inner nodes. Inner nodes are arranged near the middle of the level, with the heaviest node in the middle. It then fills whitespaces in the levels with corresponding leaves. It starts two levels above the deepest level, because the deepest level contains only nodes and therefore no reordering is necessary. And the level above the deepest level contains only children of the level above, which are ordered by the their parents.
...