|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
ICrossingReducer | Interface for algorithms that reduce crossings in a layered graph. |
IEdgeRouter | Interface for algorithms that route edges in a layered graph. |
ILayerAssigner | Interface for algorithms that assign layers to each node of a graph. |
ILayerwiseEdgePlacer | Interface for algorithms that calculate routing slots for connections going from a layer to the subsequent one. |
INodePlacer | Interface for algorithms that determine a placement for each node in a layered graph. |
INodewiseEdgePlacer | Interface for algorithms that calculate routing slots for connections starting and ending at regular nodes. |
ISingleLayerCrossingReducer | Interface for algorithms that offer heuristics for the 2-layer and 3-layer crossing reduction problem. |
Definition of the different modules used by the hierarchical dataflow layout algorithm. These interface definitions follow the strategy design pattern to separate algorithm modules from their implementation.
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |