|
|||
|
|
|
|||
|
|
#include <ogdf/simultaneous/TwoLayerCrossMinSimDraw.h>
Inheritance diagram for ogdf::TwoLayerCrossMinSimDraw:Public Member Functions | |
| TwoLayerCrossMinSimDraw () | |
| Initializes a two-layer crossing minimization module. | |
| void | call (Level &L)=0 |
Performs crossing minimization for level L. | |
| virtual void | call (Level &L, const EdgeArray< uint32_t > *esg)=0 |
Performs crossing minimization for level L. | |
| virtual TwoLayerCrossMinSimDraw * | clone () const =0 |
| Returns a new instance of the two-layer crossing minimization module with the same option settings. | |
| Public Member Functions inherited from ogdf::LayerByLayerSweep | |
| LayerByLayerSweep () | |
| Initializes a two-layer crossing minimization module. | |
| virtual | ~LayerByLayerSweep () |
| virtual void | cleanup () override |
| Performs clean-up. | |
| virtual void | init (const HierarchyLevels &levels) |
Initializes the crossing minimization module for hierarchy levels levels. | |
| void | operator() (Level &L) |
Performs crossing minimization for level L. | |
| virtual const HierarchyLevels * | reduceCrossings (const SugiyamaLayout &sugi, const Hierarchy &H, int &nCrossings) |
| virtual const HierarchyLevels * | reduceCrossings (const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings) override |
| Template method implementation of reduceCrossings from LayeredCrossMinModule. | |
| Public Member Functions inherited from ogdf::LayeredCrossMinModule | |
| LayeredCrossMinModule () | |
| Creates empty module. | |
| virtual | ~LayeredCrossMinModule () |
| Destruct. | |
Definition at line 44 of file TwoLayerCrossMinSimDraw.h.
|
inline |
Initializes a two-layer crossing minimization module.
Definition at line 47 of file TwoLayerCrossMinSimDraw.h.
|
pure virtual |
Performs crossing minimization for level L.
| L | is the level in the hierarchy on which nodes are permuted; the neighbor level (fixed level) is determined by the hierarchy. |
Implements ogdf::LayerByLayerSweep.
Implemented in ogdf::SplitHeuristic.
|
pure virtual |
Performs crossing minimization for level L.
| L | is the level in the hierarchy on which nodes are permuted; the neighbor level (fixed level) is determined by the hierarchy. |
| esg | points to an edge array which specifies to which subgraphs an edge belongs; there are up to 32 possible subgraphs each of which is represented by a bit of an uint32_t. |
Implemented in ogdf::SplitHeuristic.
|
pure virtual |
Returns a new instance of the two-layer crossing minimization module with the same option settings.
Implements ogdf::LayerByLayerSweep.
Implemented in ogdf::SplitHeuristic.
