Graph Drawing

 v. 2022.02 (Dogwood)

ogdf::LayeredCrossMinModule Class Referenceabstract

Interface of crossing minimization algorithms for layered graphs. More...

#include <ogdf/layered/LayeredCrossMinModule.h>

+ Inheritance diagram for ogdf::LayeredCrossMinModule:

Public Member Functions

 LayeredCrossMinModule ()
 Creates empty module. More...
virtual ~LayeredCrossMinModule ()
 Destruct. More...
virtual void cleanup ()
 Performs clean-up. More...
virtual const HierarchyLevelsBasereduceCrossings (const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings)=0
 Calls the actual crossing minimization algorithm. More...

Detailed Description

Interface of crossing minimization algorithms for layered graphs.

The interface of a two-layer crossing minimization algorithm consists of two methods:

  1. virtual const HierarchyLevelsBase *reduceCrossings(const SugiyamaLayout sugi, Hierarchy &H) performs crossing minimization on layered graph H as a part of Sugiyama algorithm instance sugi.
  2. cleanup() has to be called last and performs some final clean-up work.

Definition at line 54 of file LayeredCrossMinModule.h.

Constructor & Destructor Documentation

◆ LayeredCrossMinModule()

ogdf::LayeredCrossMinModule::LayeredCrossMinModule ( )

Creates empty module.

Definition at line 58 of file LayeredCrossMinModule.h.

◆ ~LayeredCrossMinModule()

virtual ogdf::LayeredCrossMinModule::~LayeredCrossMinModule ( )


Definition at line 61 of file LayeredCrossMinModule.h.

Member Function Documentation

◆ cleanup()

virtual void ogdf::LayeredCrossMinModule::cleanup ( )

◆ reduceCrossings()

virtual const HierarchyLevelsBase* ogdf::LayeredCrossMinModule::reduceCrossings ( const SugiyamaLayout sugi,
Hierarchy H,
int &  nCrossings 
pure virtual

Calls the actual crossing minimization algorithm.

Implemented in ogdf::GridSifting, ogdf::LayerByLayerSweep, and ogdf::GlobalSifting.

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