Compound Cycle Processor
Graph Transformer
Comment Preprocessor
Edge And Layer Constraint Edge Reverser

Layer Constraint Processor
Hierarchical Port Constraint Processor
Compound Dummy Edge Remover
Long Edge Splitter
Port Side Processor
Label Dummy Switcher
Inverted Port Processor
Self Loop Processor
Port List Sorter
North South Port Preprocessor

Subgraph Ordering Processor
In Layer Constraint Processor
Hyperedge Dummy Merger
Label Side Selector
Label And Node Size Processor
Node Margin Calculator
Compound Side Processor

Layer Size and Graph Height Calculator
Hierarchical Port Dummy Size Processor
Hierarchical Port Position Processor

Comment Postprocessor
Hypernode Processor
Hierarchical Port Orthogonal Edge Router
Long Edge Joiner
North South Port Postprocessor
Label Dummy Remover
Reversed Edge Restorer
Compound Graph Restorer
Graph Transformer
End Label Processor

• Comments have been processed by the Comment Preprocessor.
• Nodes are organized in layers and have been placed with enough spacing to hold their connected comment boxes.

• Comments that have been removed by pre-processing are reinserted properly in the graph.

• None.

• This processor only makes sense if the CommentPreprocessor was used before.
  

• Document

• Document

• Document

• Document

• No node exists with type LABEL.
• Only nodes of the type LABEL are deleted from the graph.

• Document

• Document

• HyperedgeDummyMerger
• InLayerConstraintProcessor
• SubgraphOrderingProcessor

• Document

• All labels on ports and edges have an assigned LabelSide unequal to UNKNOWN.

• The graph is layered.
• Nodes to be placed in the first layer only have outgoing edges.
• Nodes to be placed in the last layer only have incoming edges.

• Nodes with layer constraints have been placed in the appropriate layers.

• ConstrainedHierarchicalPortProcessor

• Layerers should usually include a dependency on this processor, unless they already adhere to layer constraints themselves.
• The LayerConstraintEdgeReverser ensures that this processor's preconditions are met. Thus, layerers should also include a dependency on that processor.

• If FIRST_SEPARATE nodes exist, they must all be present in the first layer. In that case all FIRST nodes must be located in the next layer, otherwise in the first layer. Analog for LAST_SEPARATE and LAST.

• The graph is layered.
• Nodes are assigned x and y coordinates.
• The bend points of all edges are set.

• There are no long edge dummy nodes anymore.
• The graph may not be properly layered anymore.

• HierarchicalPortOrthogonalEdgeRouter

• Since there are multiple processors that generate long edge dummies, this processor doesn't only make sense if the LongEdgeSplitter was used before.

• No node exists with type LONG_EDGE.
• Only nodes of the type LONG_EDGE are deleted from the graph.

• The graph is layered.
• Nodes are assigned y coordinates.
• The bend points of all edges are set.
• Port positions are fixed.

• North / south port dummy nodes are removed, their edges being properly routed and connected.

• This processor only makes sense if the NorthSouthPortPreprocessor was used before.

• No node exists with type NORTH_SOUTH_PORT.
• Only nodes of the type NORTH_SOUTH_PORT are deleted from the graph.

• The graph is layered.

• All nodes have at least fixed port sides.

• No node has its PortConstraints set to FREE or UNDEFINED.
• Every port has a specified PortSide.

• The graph is layered.

• Reversed edges are restored to their original direction.

• Note that this processor doesn't have any dependencies. Let's take a long edge that was reversed during phase 1 and then split into multiple segments by the LongEdgeSplitter. All the edges generated by that processor inherit the REVERSED property of the original long edge. Thus, it doesn't make any difference if we reverse all those edges before joining them to the original long edge, or if we join them first and reverse the original long edge afterwards.

• No edge exists with the REVERSED property set to true.