ogdf::SplitHeuristic Class Reference

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

#include <ogdf/layered/SplitHeuristic.h>

Inheritance diagram for ogdf::SplitHeuristic:

List of all members.

Public Member Functions
void	init (const Hierarchy &H)
	Initializes crossing minimization for hierarchy H.
void	call (Level &L)
	Calls the split heuristic for level L.
void	call (Level &L, const EdgeArray< unsigned int > *edgeSubGraph)
	Calls the median heuristic for level L (simultaneous drawing).
void	cleanup ()
	Does some clean-up after calls.
Private Member Functions
void	recCall (Level &, int low, int high)
Private Attributes
CrossingsMatrix *	m_cm
Array< node >	buffer

---

Detailed Description

The split heuristic for 2-layer crossing minimization.

Definition at line 58 of file SplitHeuristic.h.

---

Member Function Documentation

void ogdf::SplitHeuristic::call

(

Level &

L

)

[virtual]

Calls the split heuristic for level L.

Implements ogdf::TwoLayerCrossMin.

void ogdf::SplitHeuristic::call	(	Level &	L,
		const EdgeArray< unsigned int > *	edgeSubGraph
	)		[virtual]

Calls the median heuristic for level L (simultaneous drawing).

Implements ogdf::TwoLayerCrossMinSimDraw.

void ogdf::SplitHeuristic::cleanup

(

)

[virtual]

Does some clean-up after calls.

Reimplemented from ogdf::TwoLayerCrossMin.

void ogdf::SplitHeuristic::init

(

const Hierarchy &

H

)

[virtual]

Initializes crossing minimization for hierarchy H.

Reimplemented from ogdf::TwoLayerCrossMin.

void ogdf::SplitHeuristic::recCall	(	Level &	,
		int	low,
		int	high
	)		[private]

---

Member Data Documentation

Array<node> ogdf::SplitHeuristic::buffer [private]

Definition at line 75 of file SplitHeuristic.h.

CrossingsMatrix* ogdf::SplitHeuristic::m_cm [private]

Definition at line 74 of file SplitHeuristic.h.

---

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

• ogdf/layered/SplitHeuristic.h