represents compaction algorithm using min-cost flow in the dual of the constraint graph More...

#include <ogdf/orthogonal/FlowCompaction.h>

Public Member Functions
	FlowCompaction (int maxImprovementSteps=0, int costGen=1, int costAssoc=1)
	construction
void	constructiveHeuristics (PlanRep &PG, OrthoRep &OR, const RoutingChannel< int > &rc, GridLayoutMapped &drawing)
	call of constructive heuristics for orthogonal representation
void	improvementHeuristics (PlanRep &PG, OrthoRep &OR, const RoutingChannel< int > &rc, GridLayoutMapped &drawing)
	call of improvement heuristics for orthogonal drawing (variable cages)
void	improvementHeuristics (PlanRep &PG, OrthoRep &OR, MinimumEdgeDistances< int > &minDist, GridLayoutMapped &drawing, int originalSeparation)
	call of improvement heuristics for orthogonal drawing (tight cages)
void	maxImprovementSteps (int maxSteps)
	sets option maxImprovementSteps, which is the maximal number of steps performed by improvementHeuristics().
int	maxImprovementSteps () const
	returns option maxImprovementSteps
void	costGen (int c)
	sets cost of arcs in constraint graph corresponding to generalizations
int	costGen () const
	returns option costGen
void	costAssoc (int c)
	sets cost of arcs in constraint graph corresponding to associations
int	costAssoc () const
	returns option costGen
void	scalingSteps (int sc)
	sets number of separation scaling improvement steps
void	align (bool b)
	set alignment option
Private Member Functions
void	computeCoords (CompactionConstraintGraph< int > &D, NodeArray< int > &pos, bool fixZeroLength=false, bool fixVertexSize=false, bool improvementHeuristics=false, bool onlyGen=false)
void	dfsAssignPos (NodeArray< bool > &visited, NodeArray< int > &pos, node v, int x)
Private Attributes
int	m_maxImprovementSteps
	maximal number of improvement steps
int	m_costGen
	cost of arcs in constraint graph corresponding to generalization
int	m_costAssoc
	cost of arcs in constraint graph corresponding to associations
bool	m_cageExpense
	should cageedges be more expensive than others? will be propagated to compactionConstraintGraph
int	m_numGenSteps
	number of steps reserved for generalization compaction
int	m_scalingSteps
	number of improvement steps with decreasing separation
bool	m_align
	toggle if brother nodes in hierarchies should be aligned
EdgeArray< edge >	m_dualEdge
EdgeArray< int >	m_flow

Detailed Description

represents compaction algorithm using min-cost flow in the dual of the constraint graph

Definition at line 66 of file FlowCompaction.h.

Constructor & Destructor Documentation

ogdf::FlowCompaction::FlowCompaction	(	int	maxImprovementSteps = `0`,
		int	costGen = `1`,
		int	costAssoc = `1`
	)

construction

Member Function Documentation

void ogdf::FlowCompaction::align ( bool b ) [inline]

set alignment option

Definition at line 136 of file FlowCompaction.h.

void ogdf::FlowCompaction::computeCoords	(	CompactionConstraintGraph< int > &	D,
		NodeArray< int > &	pos,
		bool	fixZeroLength = `false`,
		bool	fixVertexSize = `false`,
		bool	improvementHeuristics = `false`,
		bool	onlyGen = `false`
	)		`[private]`

void ogdf::FlowCompaction::constructiveHeuristics	(	PlanRep &	PG,
		OrthoRep &	OR,
		const RoutingChannel< int > &	rc,
		GridLayoutMapped &	drawing
	)

call of constructive heuristics for orthogonal representation

void ogdf::FlowCompaction::costAssoc ( int c ) [inline]

sets cost of arcs in constraint graph corresponding to associations

Definition at line 123 of file FlowCompaction.h.

int ogdf::FlowCompaction::costAssoc ( ) const [inline]

returns option costGen

Definition at line 128 of file FlowCompaction.h.

void ogdf::FlowCompaction::costGen ( int c ) [inline]

sets cost of arcs in constraint graph corresponding to generalizations

Definition at line 113 of file FlowCompaction.h.

int ogdf::FlowCompaction::costGen ( ) const [inline]

returns option costGen

Definition at line 118 of file FlowCompaction.h.

void ogdf::FlowCompaction::dfsAssignPos	(	NodeArray< bool > &	visited,
		NodeArray< int > &	pos,
		node	v,
		int	x
	)		`[private]`

void ogdf::FlowCompaction::improvementHeuristics	(	PlanRep &	PG,
		OrthoRep &	OR,
		const RoutingChannel< int > &	rc,
		GridLayoutMapped &	drawing
	)

call of improvement heuristics for orthogonal drawing (variable cages)

void ogdf::FlowCompaction::improvementHeuristics	(	PlanRep &	PG,
		OrthoRep &	OR,
		MinimumEdgeDistances< int > &	minDist,
		GridLayoutMapped &	drawing,
		int	originalSeparation
	)