Open Graph Drawing Framework  v.2007.11

Overview Class Hierarchy Class Index Class List Members Namespaces Source Files Search for:

ogdf::BarycenterHeuristic Class Reference

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

#include <BarycenterHeuristic.h>

Inheritance diagram for ogdf::BarycenterHeuristic:

List of all members.

Public Member Functions
void	init (const Hierarchy &H)
	Initializes crossing minimization for hierarchy H.
void	call (Level &L)
	Calls the barycenter heuristic for level L.
void	cleanup ()
	Does some clean-up after calls.
Private Attributes
NodeArray< double >	m_weight
	The barycenter weight of the nodes.

---

Detailed Description

The barycenter heuristic for 2-layer crossing minimization.

Definition at line 67 of file BarycenterHeuristic.h.

---

Member Function Documentation

void ogdf::BarycenterHeuristic::init

(

const Hierarchy &

H

)

[inline, virtual]

Initializes crossing minimization for hierarchy H.

Reimplemented from ogdf::TwoLayerCrossMin.

Definition at line 71 of file BarycenterHeuristic.h.

void ogdf::BarycenterHeuristic::call

(

Level &

L

)

[virtual]

Calls the barycenter heuristic for level L.

Implements ogdf::TwoLayerCrossMin.

void ogdf::BarycenterHeuristic::cleanup

(

)

[inline, virtual]

Does some clean-up after calls.

Reimplemented from ogdf::TwoLayerCrossMin.

Definition at line 77 of file BarycenterHeuristic.h.

---

Member Data Documentation

NodeArray<double> ogdf::BarycenterHeuristic::m_weight [private]

The barycenter weight of the nodes.

Definition at line 80 of file BarycenterHeuristic.h.

---

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

• ogdf/layered/BarycenterHeuristic.h

---