#include <ogdf/simultaneous/TwoLayerCrossMinSimDraw.h>
Public Member Functions | |
TwoLayerCrossMinSimDraw () | |
Initializes a two-layer crossing minimization module. More... | |
void | call (Level &L)=0 |
Performs crossing minimization for level L . More... | |
virtual void | call (Level &L, const EdgeArray< uint32_t > *esg)=0 |
Performs crossing minimization for level L . More... | |
virtual TwoLayerCrossMinSimDraw * | clone () const =0 |
Returns a new instance of the two-layer crossing minimization module with the same option settings. More... | |
Public Member Functions inherited from ogdf::LayerByLayerSweep | |
LayerByLayerSweep () | |
Initializes a two-layer crossing minimization module. More... | |
virtual | ~LayerByLayerSweep () |
virtual void | cleanup () override |
Performs clean-up. More... | |
virtual void | init (const HierarchyLevels &levels) |
Initializes the crossing minimization module for hierarchy levels levels . More... | |
void | operator() (Level &L) |
Performs crossing minimization for level L . More... | |
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. More... | |
Public Member Functions inherited from ogdf::LayeredCrossMinModule | |
LayeredCrossMinModule () | |
Creates empty module. More... | |
virtual | ~LayeredCrossMinModule () |
Destruct. More... | |
Definition at line 39 of file TwoLayerCrossMinSimDraw.h.
|
inline |
Initializes a two-layer crossing minimization module.
Definition at line 42 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.