Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches

The median heuristic for 2-layer crossing minimization. More...

#include <ogdf/layered/MedianHeuristic.h>

+ Inheritance diagram for ogdf::MedianHeuristic:

Public Member Functions

 MedianHeuristic ()
 Creates a new instance of the median heuristic.
 
 MedianHeuristic (const MedianHeuristic &crossMin)
 Creates a new instance of the median heuristic.
 
virtual void call (Level &L) override
 Calls the median heuristic for level L.
 
virtual void cleanup () override
 Does some clean-up after calls.
 
virtual LayerByLayerSweepclone () const override
 Returns a new instance of the median heuristic with the same option settings.
 
virtual void init (const HierarchyLevels &levels) override
 Initializes 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 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.
 
- Public Member Functions inherited from ogdf::LayeredCrossMinModule
 LayeredCrossMinModule ()
 Creates empty module.
 
virtual ~LayeredCrossMinModule ()
 Destruct.
 

Private Attributes

NodeArray< intm_weight
 The median weight of a node.
 

Detailed Description

The median heuristic for 2-layer crossing minimization.

Definition at line 42 of file MedianHeuristic.h.

Constructor & Destructor Documentation

◆ MedianHeuristic() [1/2]

ogdf::MedianHeuristic::MedianHeuristic ( )
inline

Creates a new instance of the median heuristic.

Definition at line 45 of file MedianHeuristic.h.

◆ MedianHeuristic() [2/2]

ogdf::MedianHeuristic::MedianHeuristic ( const MedianHeuristic crossMin)
inline

Creates a new instance of the median heuristic.

Definition at line 48 of file MedianHeuristic.h.

Member Function Documentation

◆ call()

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

Calls the median heuristic for level L.

Implements ogdf::LayerByLayerSweep.

◆ cleanup()

virtual void ogdf::MedianHeuristic::cleanup ( )
inlineoverridevirtual

Does some clean-up after calls.

Reimplemented from ogdf::LayerByLayerSweep.

Definition at line 60 of file MedianHeuristic.h.

◆ clone()

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

Returns a new instance of the median heuristic with the same option settings.

Implements ogdf::LayerByLayerSweep.

Definition at line 51 of file MedianHeuristic.h.

◆ init()

virtual void ogdf::MedianHeuristic::init ( const HierarchyLevels levels)
inlineoverridevirtual

Initializes crossing minimization for hierarchy H.

Reimplemented from ogdf::LayerByLayerSweep.

Definition at line 54 of file MedianHeuristic.h.

Member Data Documentation

◆ m_weight

NodeArray<int> ogdf::MedianHeuristic::m_weight
private

The median weight of a node.

Definition at line 63 of file MedianHeuristic.h.


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