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.
	GreedyInsertHeuristic (const GreedyInsertHeuristic &crossMin)
	Creates a new instance of the greedy-insert heuristic.
virtual void	call (Level &L) override
	Calls the greedy insert heuristic for level L.
virtual void	cleanup () override
	Does some clean-up after calls.
virtual LayerByLayerSweep *	clone () const override
	Returns a new instance of the greed-insert heuristic with the same option settings.
virtual void	init (const HierarchyLevels &levels) override
	Initializes weights and crossing minimization for hierarchy H.
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 Attributes
CrossingsMatrix *	m_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 47 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 50 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 53 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 65 of file GreedyInsertHeuristic.h.

m_weight

NodeArray<double> ogdf::GreedyInsertHeuristic::m_weight

private

Definition at line 66 of file GreedyInsertHeuristic.h.

---

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

• include/ogdf/layered/GreedyInsertHeuristic.h