Open
Graph Drawing
Framework

 v.2012.05
 

ogdf::MedianHeuristic Class Reference

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

#include <ogdf/layered/MedianHeuristic.h>

Inheritance diagram for ogdf::MedianHeuristic:
ogdf::TwoLayerCrossMin

List of all members.

Public Member Functions

void init (const Hierarchy &H)
 Initializes crossing minimization for hierarchy H.
void call (Level &L)
 Calls the median heuristic for level L.
void cleanup ()
 Does some clean-up after calls.

Private Attributes

NodeArray< int > m_weight
 The median weight of a node.

Detailed Description

The median heuristic for 2-layer crossing minimization.

Definition at line 59 of file MedianHeuristic.h.


Member Function Documentation

void ogdf::MedianHeuristic::call ( Level L) [virtual]

Calls the median heuristic for level L.

Implements ogdf::TwoLayerCrossMin.

void ogdf::MedianHeuristic::cleanup ( ) [inline, virtual]

Does some clean-up after calls.

Reimplemented from ogdf::TwoLayerCrossMin.

Definition at line 69 of file MedianHeuristic.h.

void ogdf::MedianHeuristic::init ( const Hierarchy H) [inline, virtual]

Initializes crossing minimization for hierarchy H.

Reimplemented from ogdf::TwoLayerCrossMin.

Definition at line 63 of file MedianHeuristic.h.


Member Data Documentation

The median weight of a node.

Definition at line 72 of file MedianHeuristic.h.


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