The split heuristic for 2-layer crossing minimization. More...
#include <ogdf/layered/SplitHeuristic.h>
Public Member Functions | |
SplitHeuristic () | |
Creates a new instance of the split heuristic. | |
SplitHeuristic (const SplitHeuristic &crossMin) | |
Creates a new instance of the split heuristic. | |
~SplitHeuristic () | |
void | call (Level &L) override |
Calls the split heuristic for level L . | |
void | call (Level &L, const EdgeArray< uint32_t > *edgeSubGraphs) override |
Calls the median heuristic for level L (simultaneous drawing). | |
void | cleanup () override |
Does some clean-up after calls. | |
TwoLayerCrossMinSimDraw * | clone () const override |
Returns a new instance of the splitheurisitc with the same option settings. | |
void | init (const HierarchyLevels &levels) override |
Initializes crossing minimization for hierarchy H. | |
Public Member Functions inherited from ogdf::TwoLayerCrossMinSimDraw | |
TwoLayerCrossMinSimDraw () | |
Initializes a two-layer crossing minimization module. | |
Public Member Functions inherited from ogdf::LayerByLayerSweep | |
LayerByLayerSweep () | |
Initializes a two-layer crossing minimization module. | |
virtual | ~LayerByLayerSweep () |
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. | |
Private Member Functions | |
void | recCall (Level &, int low, int high) |
Private Attributes | |
Array< node > | m_buffer |
CrossingsMatrix * | m_cm |
The split heuristic for 2-layer crossing minimization.
Definition at line 45 of file SplitHeuristic.h.
|
inline |
Creates a new instance of the split heuristic.
Definition at line 48 of file SplitHeuristic.h.
|
inline |
Creates a new instance of the split heuristic.
Definition at line 51 of file SplitHeuristic.h.
|
inline |
Definition at line 53 of file SplitHeuristic.h.
Calls the split heuristic for level L
.
Implements ogdf::TwoLayerCrossMinSimDraw.
|
overridevirtual |
Calls the median heuristic for level L
(simultaneous drawing).
Implements ogdf::TwoLayerCrossMinSimDraw.
|
overridevirtual |
Does some clean-up after calls.
Reimplemented from ogdf::LayerByLayerSweep.
|
inlineoverridevirtual |
Returns a new instance of the splitheurisitc with the same option settings.
Implements ogdf::TwoLayerCrossMinSimDraw.
Definition at line 56 of file SplitHeuristic.h.
|
overridevirtual |
Initializes crossing minimization for hierarchy H.
Reimplemented from ogdf::LayerByLayerSweep.
Definition at line 72 of file SplitHeuristic.h.
|
private |
Definition at line 71 of file SplitHeuristic.h.