Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::GreedyInsertHeuristic Class Reference

The greedy-insert heuristic for 2-layer crossing minimization. More...

#include <ogdf/layered/GreedyInsertHeuristic.h>

+ Inheritance diagram for ogdf::GreedyInsertHeuristic:

Public Member Functions

 GreedyInsertHeuristic ()
 Creates a new instance of the greedy-insert heuristic. More...
 
 GreedyInsertHeuristic (const GreedyInsertHeuristic &crossMin)
 Creates a new instance of the greedy-insert heuristic. More...
 
virtual void call (Level &L) override
 Calls the greedy insert heuristic for level L. More...
 
virtual void cleanup () override
 Does some clean-up after calls. More...
 
virtual LayerByLayerSweepclone () const override
 Returns a new instance of the greed-insert heuristic with the same option settings. More...
 
virtual void init (const HierarchyLevels &levels) override
 Initializes weights and crossing minimization for hierarchy H. More...
 
- Public Member Functions inherited from ogdf::LayerByLayerSweep
 LayerByLayerSweep ()
 Initializes a two-layer crossing minimization module. More...
 
virtual ~LayerByLayerSweep ()
 
void operator() (Level &L)
 Performs crossing minimization for level L. More...
 
virtual const HierarchyLevelsreduceCrossings (const SugiyamaLayout &sugi, const Hierarchy &H, int &nCrossings)
 
virtual const HierarchyLevelsreduceCrossings (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...
 

Private Attributes

CrossingsMatrixm_crossingMatrix
 
NodeArray< double > m_weight
 

Detailed Description

The greedy-insert heuristic for 2-layer crossing minimization.

Definition at line 44 of file GreedyInsertHeuristic.h.

Constructor & Destructor Documentation

◆ GreedyInsertHeuristic() [1/2]

ogdf::GreedyInsertHeuristic::GreedyInsertHeuristic ( )
inline

Creates a new instance of the greedy-insert heuristic.

Definition at line 48 of file GreedyInsertHeuristic.h.

◆ GreedyInsertHeuristic() [2/2]

ogdf::GreedyInsertHeuristic::GreedyInsertHeuristic ( const GreedyInsertHeuristic crossMin)
inline

Creates a new instance of the greedy-insert heuristic.

Definition at line 51 of file GreedyInsertHeuristic.h.

Member Function Documentation

◆ call()

virtual void ogdf::GreedyInsertHeuristic::call ( Level L)
overridevirtual

Calls the greedy insert heuristic for level L.

Implements ogdf::LayerByLayerSweep.

◆ cleanup()

virtual void ogdf::GreedyInsertHeuristic::cleanup ( )
overridevirtual

Does some clean-up after calls.

Reimplemented from ogdf::LayerByLayerSweep.

◆ clone()

virtual LayerByLayerSweep* ogdf::GreedyInsertHeuristic::clone ( ) const
inlineoverridevirtual

Returns a new instance of the greed-insert heuristic with the same option settings.

Implements ogdf::LayerByLayerSweep.

Definition at line 54 of file GreedyInsertHeuristic.h.

◆ init()

virtual void ogdf::GreedyInsertHeuristic::init ( const HierarchyLevels levels)
overridevirtual

Initializes weights and crossing minimization for hierarchy H.

Reimplemented from ogdf::LayerByLayerSweep.

Member Data Documentation

◆ m_crossingMatrix

CrossingsMatrix* ogdf::GreedyInsertHeuristic::m_crossingMatrix
private

Definition at line 69 of file GreedyInsertHeuristic.h.

◆ m_weight

NodeArray<double> ogdf::GreedyInsertHeuristic::m_weight
private

Definition at line 70 of file GreedyInsertHeuristic.h.


The documentation for this class was generated from the following file: