Date: Thu, 28 Mar 2024 12:10:38 +0000 (UTC) Message-ID: <930744792.6425.1711627838052@2f9704fbf185> Subject: Exported From Confluence MIME-Version: 1.0 Content-Type: multipart/related; boundary="----=_Part_6424_810541261.1711627838051" ------=_Part_6424_810541261.1711627838051 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable Content-Location: file:///C:/exported.html
This page gives an =
overview of the processors=
span> and their functions. Processor=
s run between the main phases of the algorithm to solve some problems or ju=
st to calculate some simple values that are necessary for the next phases.<=
/p>
A processor which sets the final coordinates for each node in a given gr=
aph. The property XCOOR has to be set before this processor is called. Sinc=
e it sets the final coordinates of each nodes it is invoked after the Node =
Placer has done its work. This is a processor that computes the maximal fan out for each node in t=
he given graph. The maximal fan out of a node is the maximal number of desc=
endants it has got in one level. This is an attribute that is needed by the=
Node Orderer and hence the Fan Processor runs right before that phase. A processor which determines the height for each level by setting =
it to the height of the tallest node of the level. The LevelHeight Processo=
r also runs before the Node Orderer. 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 s=
ame level. A sibling is a neighbor with the same parent. Last but not least=
the calculations of this processor are also needed by the Node Orderer. A processor that connects all roots of a given graph to a super root whi=
ch then is the new root of the graph. Necessary if a graph has multiple roo=
ts. This processor is invoked right after the "Treeifying" phase. This processor should run as a post-processor for the first phase.=
It should run through the list of edges that once destroyed the tree prope=
rty and simply insert that edges directly after layouting the graph. It run=
s after the edge routing and for now just inserts the previously deleted ed=
ges directly.Coordinate Processor
Fan Processor
LevelHeight Processor
Neighbors Processor
Root Processor
(De-)/Untreeifying Pro=
cessor