The median heuristic for 2-layer crossing minimization. More...
#include <ogdf/layered/MedianHeuristic.h>
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. | |
The median heuristic for 2-layer crossing minimization.
Definition at line 59 of file MedianHeuristic.h.
| 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.
NodeArray<int> ogdf::MedianHeuristic::m_weight [private] |
The median weight of a node.
Definition at line 72 of file MedianHeuristic.h.