This page gives an overview over the processors and its functions. Processors run in between the main phases of the algorithm to solve some problems or just to calculate some simple values that are necessary for the main phases to work.
A processor which sets the final coordinates for each node in a given graph. The property XCOOR has to be set before this processor is called.
This is a processor that computes the maximal fan out for each node in the given graph. The maximal fan out of a node is the maximal number of descendants it has got in one level.
A processor which determines the height for each level by setting it to the height of the tallest node of the level.
The processor which determines the neighbors and siblings for all nodes in the graph. A neighbor is the current node's nearest node, at the same level. A sibling is a neighbor with the same parent.
A processor that connects all roots of a given graph to a super root which then is the new root of the graph. Necessary if a graph has multiple roots.
This processor should run as a post-processor after the first phase. It should run through the list of edges that once destroyed the tree property and simply insert that edges directly after layouting the graph.