ogdf::MMSubgraphPlanarizer Class Reference

Planarization approach for minor-monotone crossing minimization. More...

#include <ogdf/planarity/MMSubgraphPlanarizer.h>

Inheritance diagram for ogdf::MMSubgraphPlanarizer:

List of all members.

Public Member Functions
	MMSubgraphPlanarizer ()
	Creates a subgraph planarizer for minor-monotone crossing minimization.
void	setSubgraph (PlanarSubgraphModule *pSubgraph)
	Sets the module option for the computation of the planar subgraph.
void	setInserter (MMEdgeInsertionModule *pInserter)
	Sets the module option for minor-monotone edge insertion.
int	permutations ()
	Returns the number of performed permutations in the edge insertion step.
void	permutations (int p)
	Sets the number of performed permutations in the edge insertion step.
Protected Member Functions
virtual ReturnType	doCall (PlanRepExpansion &PG, int cc, const EdgeArray< bool > *forbid, int &crossingNumber, int &numNS, int &numSN)
	Actual algorithm call that needs to be implemented by derived classed.
Private Attributes
ModuleOption < PlanarSubgraphModule >	m_subgraph
	The planar subgraph module.
ModuleOption < MMEdgeInsertionModule >	m_inserter
	The minor-monotone edge insertion module.
int	m_permutations
	The number of permutations.

---

Detailed Description

Planarization approach for minor-monotone crossing minimization.

Definition at line 59 of file MMSubgraphPlanarizer.h.

---

Constructor & Destructor Documentation

ogdf::MMSubgraphPlanarizer::MMSubgraphPlanarizer

(

)

Creates a subgraph planarizer for minor-monotone crossing minimization.

---

Member Function Documentation

virtual ReturnType ogdf::MMSubgraphPlanarizer::doCall	(	PlanRepExpansion &	PG,
		int	cc,
		const EdgeArray< bool > *	forbid,
		int &	crossingNumber,
		int &	numNS,
		int &	numSN
	)		[protected, virtual]

Actual algorithm call that needs to be implemented by derived classed.

Parameters:

PG	represents the input graph as well as the computed planarized expansion after the call. PG is initialized as a PlanRepExpansion of the input graph and needs to be modified to obatain the planarized representation (crossings are replaced by dummy vertices with degree four).
cc	is the number of the connected component in PG that is considered.
forbid	points to an edge array indicating which edges are not allowed to be crossed, i.e., (*forbid)[e] = true.
crossingNumber	needs to be assigned the number of crossings.
numNS	needs to be assigned the required number of node splits.
numSN	needs to be assigned the number of splitted nodes.

Returns:

the status of the result.

Implements ogdf::MMCrossingMinimizationModule.

int ogdf::MMSubgraphPlanarizer::permutations

(

)

[inline]

Returns the number of performed permutations in the edge insertion step.

Definition at line 76 of file MMSubgraphPlanarizer.h.

void ogdf::MMSubgraphPlanarizer::permutations

(

int

p

)

[inline]

Sets the number of performed permutations in the edge insertion step.

Definition at line 79 of file MMSubgraphPlanarizer.h.

void ogdf::MMSubgraphPlanarizer::setInserter

(

MMEdgeInsertionModule *

pInserter

)

[inline]

Sets the module option for minor-monotone edge insertion.

Definition at line 71 of file MMSubgraphPlanarizer.h.

void ogdf::MMSubgraphPlanarizer::setSubgraph

(

PlanarSubgraphModule *

pSubgraph

)

[inline]

Sets the module option for the computation of the planar subgraph.

Definition at line 66 of file MMSubgraphPlanarizer.h.

---

Member Data Documentation

ModuleOption<MMEdgeInsertionModule> ogdf::MMSubgraphPlanarizer::m_inserter [private]

The minor-monotone edge insertion module.

Definition at line 91 of file MMSubgraphPlanarizer.h.

int ogdf::MMSubgraphPlanarizer::m_permutations [private]

The number of permutations.

Definition at line 93 of file MMSubgraphPlanarizer.h.

ModuleOption<PlanarSubgraphModule> ogdf::MMSubgraphPlanarizer::m_subgraph [private]

The planar subgraph module.

Definition at line 90 of file MMSubgraphPlanarizer.h.

---

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

• ogdf/planarity/MMSubgraphPlanarizer.h