Planarized representations (of a connected component) of a graph. More...

#include <ogdf/planarity/PlanRep.h>

Inheritance diagram for ogdf::PlanRep:

Classes
struct	Deg1RestoreInfo
	Information for restoring degree-1 nodes. More...
Public Member Functions


	PlanRep (const Graph &G)
	PlanRep (const GraphAttributes &AG)
	Creates a planarized representation of graph AG.
virtual	~PlanRep ()
Processing connected components
Planarized representations provide a mechanism for always representing a copy of a single component of the original graph.
int	numberOfCCs () const
	Returns the number of connected components in the original graph.
int	currentCC () const
	Returns the index of the current connected component (-1 if not yet initialized).
const List< node > &	nodesInCC (int i) const
	Returns the list of (original) nodes in connected component i.
const List< node > &	nodesInCC () const
	Returns the list of (original) nodes in the current connected component.
void	initCC (int i)
	Initializes the planarized representation for connected component i.
Node expansion

adjEntry	expandAdj (node v) const
	Returns the adjacency entry of a node of an expanded face.
adjEntry &	expandAdj (node v)
Clique boundary

adjEntry	boundaryAdj (node v) const
adjEntry &	boundaryAdj (node v)
void	setCliqueBoundary (edge e)
bool	isCliqueBoundary (edge e)
Node types

Graph::NodeType	typeOf (node v) const
	Returns the type of node v.
Graph::NodeType &	typeOf (node v)
	Returns a reference to the type of node v.
bool	isVertex (node v)
	Returns true if the node represents a "real" object in the original graph.
nodeType	nodeTypeOf (node v)
	Returns the extended node type of v.
void	setCrossingType (node v)
	Classifies node v as a crossing.
bool	isCrossingType (node v)
	Returns true iff node v is classified as a crossing.
Edge types

EdgeType	typeOf (edge e) const
	Returns the type of edge e.
EdgeType &	typeOf (edge e)
	Returns a reference to the type of edge e.
edgeType &	oriEdgeTypes (edge e)
	Returns a reference to the type of original edge e.
edgeType	edgeTypeOf (edge e)
	Returns the new type field of e.
edgeType &	edgeTypes (edge e)
	Returns a reference to the new type field of e.
void	setEdgeTypeOf (edge e, edgeType et)
	Sets the new type field of edge e to et.
void	setType (edge e, EdgeType et)
	Set both type values of e at once.
bool	isGeneralization (edge e)
	Returns true iff edge e is classified as generalization.
void	setGeneralization (edge e)
	Classifies edge e as generalization (primary type).
bool	isDependency (edge e)
	Returns true iff edge e is classified as dependency.
void	setDependency (edge e)
	Classifies edge e as dependency (primary type).
void	setAssociation (edge e)
	Classifies edge e as association (primary type).
void	setExpansion (edge e)
	Classifies edge e as expansion edge (secondary type).
bool	isExpansion (edge e)
	Returns true iff edge e is classified as expansion edge.
bool	isBoundary (edge e)
	Returns true iff edge e is a clique boundary.
void	setAssClass (edge e)
	Classifies edge e as connection at an association class (tertiary type).
bool	isAssClass (edge e)
	Returns true iff edge e is classified as connection at an association class.
void	setBrother (edge e)
	Classifies edge e as connection between hierarchy neighbours (fourth level type).
void	setHalfBrother (edge e)
	Classifies edge e as connection between ... (fourth level type).
bool	isBrother (edge e)
	Returns true if edge e is classified as brother.
bool	isHalfBrother (edge e)
	Returns true if edge e is classified as half-brother.
edgeType	edgeTypeAND (edge e, edgeType et)
edgeType	edgeTypeOR (edge e, edgeType et)
void	setPrimaryType (edge e, edgeType et)
void	setSecondaryType (edge e, edgeType et)
edgeType	edgeTypePrimaryAND (edge e, edgeType et)
edgeType	edgeTypePrimaryOR (edge e, edgeType et)
void	setUserType (edge e, edgeType et)
bool	isUserType (edge e, edgeType et)
void	setExpansionEdge (edge e, int expType)
bool	isExpansionEdge (edge e) const
int	expansionType (edge e) const
bool	isDegreeExpansionEdge (edge e) const
Access to attributes in original graph
These methods provide easy access to attributes of original nodes and edges.
const NodeArray< double > &	widthOrig () const
	Gives access to the node array of the widths of original nodes.
double	widthOrig (node v) const
	Returns the width of original node v.
const NodeArray< double > &	heightOrig () const
	Gives access to the node array of the heights of original nodes.
double	heightOrig (node v) const
	Returns the height of original node v.
EdgeType	typeOrig (edge e) const
	Returns the type of original edge e.
const GraphAttributes &	getGraphAttributes () const
	Returns the graph attributes of the original graph (the pointer may be 0).
Structural alterations

void	expand (bool lowDegreeExpand=false)
void	expandLowDegreeVertices (OrthoRep &OR)
void	collapseVertices (const OrthoRep &OR, Layout &drawing)
void	removeCrossing (node v)
void	insertBoundary (node center, adjEntry &adjExternal)
Extension of methods defined by GraphCopys

virtual edge	split (edge e)
	Splits edge e.
node	expandedNode (node v) const
void	setExpandedNode (node v, node w)
Creation of new nodes and edges

node	newCopy (node vOrig, Graph::NodeType vType)
	Creates a new node with node type vType in the planarized representation.
edge	newCopy (node v, adjEntry adjAfter, edge eOrig)
	Creates a new edge in the planarized representation.
edge	newCopy (node v, adjEntry adjAfter, edge eOrig, CombinatorialEmbedding &E)
	Creates a new edge in the planarized representation while updating the embedding E.
Crossings

bool	embed ()
void	removePseudoCrossings ()
void	insertEdgePath (edge eOrig, const SList< adjEntry > &crossedEdges)
	Re-inserts edge eOrig by "crossing" the edges in crossedEdges.
void	insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
	Re-inserts edge eOrig by "crossing" the edges in crossedEdges in embedding E.
void	removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSetPure &newFaces)
edge	insertCrossing (edge &crossingEdge, const edge crossedEdge, bool topDown)
	Inserts crossings between already existing edges (used in TopologyModule).
Degree-1 nodes
These methods realize a mechanism for temporarily removing degree-1 nodes.
void	removeDeg1Nodes (Stack< Deg1RestoreInfo > &S, const NodeArray< bool > &mark)
	Removes all marked degree-1 nodes from the graph copy and stores restore information in S.
void	restoreDeg1Nodes (Stack< Deg1RestoreInfo > &S, List< node > &deg1s)
	Restores degree-1 nodes previously removed with removeDeg1Nodes().
Protected Member Functions
void	setCopyType (edge eCopy, edge eOrig)
edgeType	generalizationPattern ()
edgeType	associationPattern ()
edgeType	expansionPattern ()
edgeType	assClassPattern ()
edgeType	brotherPattern ()
edgeType	halfBrotherPattern ()
edgeType	cliquePattern ()
void	removeUnnecessaryCrossing (adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)
Protected Attributes
int	m_currentCC
	The index of the current component.
int	m_numCC
	The number of components in the original graph.
Array< List< node > >	m_nodesInCC
	The list of original nodes in each component.
const GraphAttributes *	m_pGraphAttributes
	Pointer to graph attributes of original graph.
NodeArray< NodeType >	m_vType
	Simple node types.
NodeArray< nodeType >	m_nodeTypes
	Node types for extended semantic information.
NodeArray< node >	m_expandedNode
	For all expansion nodes, save expanded node.
NodeArray< adjEntry >	m_expandAdj
NodeArray< adjEntry >	m_boundaryAdj
EdgeArray< int >	m_expansionEdge
EdgeArray< EdgeType >	m_eType
EdgeArray< edgeType >	m_edgeTypes
EdgeArray< edgeType >	m_oriEdgeTypes
EdgeArray< edge >	m_eAuxCopy

Detailed Description

Planarized representations (of a connected component) of a graph.

Maintains types of edges (generalization, association) and nodes, and the connected components of the graph.

Definition at line 83 of file PlanRep.h.

Constructor & Destructor Documentation

ogdf::PlanRep::PlanRep ( const Graph & G )

ogdf::PlanRep::PlanRep ( const GraphAttributes & AG )

Creates a planarized representation of graph AG.

virtual ogdf::PlanRep::~PlanRep ( ) [inline, virtual]

Definition at line 109 of file PlanRep.h.

Member Function Documentation

edgeType ogdf::PlanRep::assClassPattern ( ) [inline, protected]

Definition at line 715 of file PlanRep.h.

edgeType ogdf::PlanRep::associationPattern ( ) [inline, protected]

Definition at line 713 of file PlanRep.h.

adjEntry& ogdf::PlanRep::boundaryAdj ( node v ) [inline]

Returns a reference to the adjacency entry of the first edge of the inserted boundary at a center node (original) of a clique, 0 if no boundary exists

Definition at line 198 of file PlanRep.h.

adjEntry ogdf::PlanRep::boundaryAdj ( node v ) const [inline]

Returns the adjacency entry of the first edge of the inserted boundary at a center node (original) of a clique, 0 if no boundary exists

Definition at line 190 of file PlanRep.h.

edgeType ogdf::PlanRep::brotherPattern ( ) [inline, protected]

Definition at line 716 of file PlanRep.h.

edgeType ogdf::PlanRep::cliquePattern ( ) [inline, protected]

Definition at line 718 of file PlanRep.h.

void ogdf::PlanRep::collapseVertices	(	const OrthoRep &	OR,
		Layout &	drawing
	)

Reimplemented in ogdf::PlanRepUML.

int ogdf::PlanRep::currentCC ( ) const [inline]

Returns the index of the current connected component (-1 if not yet initialized).

Definition at line 130 of file PlanRep.h.

edgeType ogdf::PlanRep::edgeTypeAND	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 463 of file PlanRep.h.

edgeType ogdf::PlanRep::edgeTypeOf ( edge e ) [inline]

Returns the new type field of e.

Parameters:

e

is an edge in the planarized representation.

Definition at line 309 of file PlanRep.h.

edgeType ogdf::PlanRep::edgeTypeOR	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 465 of file PlanRep.h.

edgeType ogdf::PlanRep::edgeTypePrimaryAND	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 476 of file PlanRep.h.

edgeType ogdf::PlanRep::edgeTypePrimaryOR	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 479 of file PlanRep.h.

edgeType& ogdf::PlanRep::edgeTypes ( edge e ) [inline]

Returns a reference to the new type field of e.

Parameters:

e

is an edge in the planarized representation.

Definition at line 318 of file PlanRep.h.

bool ogdf::PlanRep::embed ( )

void ogdf::PlanRep::expand ( bool lowDegreeExpand = false )

Reimplemented in ogdf::ClusterPlanRep, and ogdf::PlanRepUML.

adjEntry ogdf::PlanRep::expandAdj ( node v ) const [inline]

Returns the adjacency entry of a node of an expanded face.

If no such entry is stored at node v, 0 is returned.

Definition at line 172 of file PlanRep.h.

adjEntry& ogdf::PlanRep::expandAdj ( node v ) [inline]

Definition at line 176 of file PlanRep.h.

node ogdf::PlanRep::expandedNode ( node v ) const [inline]

Definition at line 591 of file PlanRep.h.

void ogdf::PlanRep::expandLowDegreeVertices ( OrthoRep & OR )

Reimplemented in ogdf::ClusterPlanRep.

edgeType ogdf::PlanRep::expansionPattern ( ) [inline, protected]

Definition at line 714 of file PlanRep.h.

int ogdf::PlanRep::expansionType ( edge e ) const [inline]

Definition at line 512 of file PlanRep.h.

edgeType ogdf::PlanRep::generalizationPattern ( ) [inline, protected]

Definition at line 712 of file PlanRep.h.

const GraphAttributes& ogdf::PlanRep::getGraphAttributes ( ) const [inline]

Returns the graph attributes of the original graph (the pointer may be 0).

Definition at line 556 of file PlanRep.h.

edgeType ogdf::PlanRep::halfBrotherPattern ( ) [inline, protected]

Definition at line 717 of file PlanRep.h.

const NodeArray<double>& ogdf::PlanRep::heightOrig ( ) const [inline]

Gives access to the node array of the heights of original nodes.

Definition at line 541 of file PlanRep.h.

double ogdf::PlanRep::heightOrig ( node v ) const [inline]

Returns the height of original node v.

Definition at line 546 of file PlanRep.h.

void ogdf::PlanRep::initCC ( int i )

Initializes the planarized representation for connected component i.

This initialization is always required. After performing this initialization, the planarized representation represents a copy of the i-th connected component of the original graph, where connected components are numbered 0,1,2,...

Reimplemented in ogdf::ClusterPlanRep, and ogdf::PlanRepUML.

void ogdf::PlanRep::insertBoundary	(	node	center,
		adjEntry &	adjExternal
	)

edge ogdf::PlanRep::insertCrossing	(	edge &	crossingEdge,
		const edge	crossedEdge,
		bool	topDown
	)

Inserts crossings between already existing edges (used in TopologyModule).

Replaces crossingEdge by first crossingEdge part and returns second.

Parameters:

topDown

describes the following: if the crossingEdge is running horizontally from left to right, is the crossedEdge direction top->down?

Reimplemented from ogdf::GraphCopy.

void ogdf::PlanRep::insertEdgePath	(	edge	eOrig,
		const SList< adjEntry > &	crossedEdges
	)

Re-inserts edge eOrig by "crossing" the edges in crossedEdges.

Let v and w be the copies of the source and target nodes of eOrig. Each edge in crossedEdges is split creating a sequence $u_1,\ldots,u_k$ of new nodes, and additional edges are inserted creating a path $v,u_1,\ldots,u_k,w$ .

Parameters:

	eOrig	is an edge in the original graph and becomes the original edge of all edges in the path $v,u_1,\ldots,u_k,w$ .
	crossedEdges	are edges in the graph copy.

Reimplemented from ogdf::GraphCopy.

void ogdf::PlanRep::insertEdgePathEmbedded	(	edge	eOrig,
		CombinatorialEmbedding &	E,
		const SList< adjEntry > &	crossedEdges
	)

Re-inserts edge eOrig by "crossing" the edges in crossedEdges in embedding E.

Let v and w be the copies of the source and target nodes of eOrig, and let $e_0,e_1,\ldots,e_k,e_{k+1}$ be the sequence of edges corresponding to the adjacency entries in crossedEdges. The first edge needs to be incident to v and the last to w; the edges $e_1,\ldots,e_k$ are each split creating a sequence $u_1,\ldots,u_k$ of new nodes, and additional edges are inserted creating a path $v,u_1,\ldots,u_k,w$ .

The following figure illustrates, which adjacency entries need to be in the list crossedEdges. It inserts an edge connecting v and w by passing through the faces $f_0,f_1,f_2$ ; in this case, the list crossedEdges must contain the adjacency entries $adj_0,\ldots,adj_3$ (in this order).

Parameters:

	eOrig	is an edge in the original graph and becomes the original edge of all edges in the path $v,u_1,\ldots,u_k,w$ .
	E	is an embedding of the graph copy.
	crossedEdges	are a list of adjacency entries in the graph copy.

Reimplemented from ogdf::GraphCopy.

Reimplemented in ogdf::ClusterPlanRep.

bool ogdf::PlanRep::isAssClass ( edge e ) [inline]

Returns true iff edge e is classified as connection at an association class.

Definition at line 431 of file PlanRep.h.

bool ogdf::PlanRep::isBoundary ( edge e ) [inline]

Returns true iff edge e is a clique boundary.

Definition at line 418 of file PlanRep.h.

bool ogdf::PlanRep::isBrother ( edge e ) [inline]

Returns true if edge e is classified as brother.

Definition at line 451 of file PlanRep.h.

bool ogdf::PlanRep::isCliqueBoundary ( edge e ) [inline]

Definition at line 206 of file PlanRep.h.

bool ogdf::PlanRep::isCrossingType ( node v ) [inline]

Returns true iff node v is classified as a crossing.

Parameters:

v

is a node in the planarized representation.

Definition at line 269 of file PlanRep.h.

bool ogdf::PlanRep::isDegreeExpansionEdge ( edge e ) const [inline]

Definition at line 515 of file PlanRep.h.

bool ogdf::PlanRep::isDependency ( edge e ) [inline]

Returns true iff edge e is classified as dependency.

Definition at line 376 of file PlanRep.h.

bool ogdf::PlanRep::isExpansion ( edge e ) [inline]

Returns true iff edge e is classified as expansion edge.

Definition at line 411 of file PlanRep.h.

bool ogdf::PlanRep::isExpansionEdge ( edge e ) const [inline]

Definition at line 508 of file PlanRep.h.

bool ogdf::PlanRep::isGeneralization ( edge e ) [inline]

Returns true iff edge e is classified as generalization.

Definition at line 362 of file PlanRep.h.

bool ogdf::PlanRep::isHalfBrother ( edge e ) [inline]

Returns true if edge e is classified as half-brother.

Definition at line 456 of file PlanRep.h.

bool ogdf::PlanRep::isUserType	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 488 of file PlanRep.h.

bool ogdf::PlanRep::isVertex ( node v ) [inline]

Returns true if the node represents a "real" object in the original graph.

Todo:: It is necessary to check for several different possible types. This should be solved by combining representation types (vertex, dummy,...) with semantic types (class, interface,...) within GraphAttributes; we then can return to vertex only.

Definition at line 241 of file PlanRep.h.

node ogdf::PlanRep::newCopy	(	node	vOrig,
		Graph::NodeType	vType
	)

Creates a new node with node type vType in the planarized representation.

Parameters:

	vOrig	becomes the original node of the new node.
	vType	becomes the type of the new node.

edge ogdf::PlanRep::newCopy	(	node	v,
		adjEntry	adjAfter,
		edge	eOrig
	)

Creates a new edge in the planarized representation.

Parameters:

	v	is the source node of the new edge.
	adjAfter	is the adjacency entry at the target node, after which the new edge is inserted.
	eOrig	becomes the original edge of the new edge.

edge ogdf::PlanRep::newCopy	(	node	v,
		adjEntry	adjAfter,
		edge	eOrig,
		CombinatorialEmbedding &	E
	)

Creates a new edge in the planarized representation while updating the embedding E.

Parameters:

	v	is the source node of the new edge.
	adjAfter	is the adjacency entry at the target node, after which the new edge is inserted.
	eOrig	becomes the original edge of the new edge.
	E	is an embedding of the planarized representation.

const List<node>& ogdf::PlanRep::nodesInCC ( ) const [inline]

Returns the list of (original) nodes in the current connected component.

Definition at line 146 of file PlanRep.h.

const List<node>& ogdf::PlanRep::nodesInCC ( int i ) const [inline]

Returns the list of (original) nodes in connected component i.

Note that connected components are numbered 0,1,...

Definition at line 139 of file PlanRep.h.

nodeType ogdf::PlanRep::nodeTypeOf ( node v ) [inline]

Returns the extended node type of v.

Parameters:

v

is a node in the planarized representation.

Definition at line 251 of file PlanRep.h.

int ogdf::PlanRep::numberOfCCs ( ) const [inline]

Returns the number of connected components in the original graph.

Definition at line 123 of file PlanRep.h.

edgeType& ogdf::PlanRep::oriEdgeTypes ( edge e ) [inline]

Returns a reference to the type of original edge e.

Parameters:

e

is an edge in the original graph.

Definition at line 300 of file PlanRep.h.

void ogdf::PlanRep::removeCrossing ( node v )

void ogdf::PlanRep::removeDeg1Nodes	(	Stack< Deg1RestoreInfo > &	S,
		const NodeArray< bool > &	mark
	)

Removes all marked degree-1 nodes from the graph copy and stores restore information in S.

Parameters:

	S	returns the restore information required by restoreDeg1Nodes().
	mark	defines which nodes are marked for removal; all nodes v with mark[v]=true are removed.

Precondition:: Only nodes with degree 1 may be marked.

void ogdf::PlanRep::removeEdgePathEmbedded	(	CombinatorialEmbedding &	E,
		edge	eOrig,
		FaceSetPure &	newFaces
	)			`[inline]`

Removes the complete edge path for edge eOrig while preserving the embedding.

Parameters:

	E	is an embedding of the graph copy.
	eOrig	is an edge in the original graph.
	newFaces	is assigned the set of new faces resulting from joining faces when removing edges.

Reimplemented from ogdf::GraphCopy.

Definition at line 655 of file PlanRep.h.

void ogdf::PlanRep::removePseudoCrossings ( )

void ogdf::PlanRep::removeUnnecessaryCrossing	(	adjEntry	adjA1,
		adjEntry	adjA2,
		adjEntry	adjB1,
		adjEntry	adjB2
	)			`[protected]`

void ogdf::PlanRep::restoreDeg1Nodes	(	Stack< Deg1RestoreInfo > &	S,
		List< node > &	deg1s
	)

Restores degree-1 nodes previously removed with removeDeg1Nodes().

Parameters:

	S	contains the restore information.
	deg1s	returns the list of newly created nodes in the copy.

void ogdf::PlanRep::setAssClass ( edge e ) [inline]

Classifies edge e as connection at an association class (tertiary type).

Definition at line 425 of file PlanRep.h.

void ogdf::PlanRep::setAssociation ( edge e ) [inline]

Classifies edge e as association (primary type).

Definition at line 390 of file PlanRep.h.

void ogdf::PlanRep::setBrother ( edge e ) [inline]

Classifies edge e as connection between hierarchy neighbours (fourth level type).

Definition at line 441 of file PlanRep.h.

void ogdf::PlanRep::setCliqueBoundary ( edge e ) [inline]

Definition at line 203 of file PlanRep.h.

void ogdf::PlanRep::setCopyType	(	edge	eCopy,
		edge	eOrig
	)			`[protected]`

void ogdf::PlanRep::setCrossingType ( node v ) [inline]

Classifies node v as a crossing.

Parameters:

v

is a node in the planarized representation.

Definition at line 260 of file PlanRep.h.

void ogdf::PlanRep::setDependency ( edge e ) [inline]

Classifies edge e as dependency (primary type).

Definition at line 382 of file PlanRep.h.

void ogdf::PlanRep::setEdgeTypeOf	(	edge	e,
		edgeType	et
	)			`[inline]`

Sets the new type field of edge e to et.

Parameters:

	e	is an edge in the planarized representation.
	et	is the type assigned to e.

Definition at line 328 of file PlanRep.h.

void ogdf::PlanRep::setExpandedNode	(	node	v,
		node	w
	)			`[inline]`

Definition at line 593 of file PlanRep.h.

void ogdf::PlanRep::setExpansion ( edge e ) [inline]

Classifies edge e as expansion edge (secondary type).

Definition at line 403 of file PlanRep.h.

void ogdf::PlanRep::setExpansionEdge	(	edge	e,
		int	expType
	)			`[inline]`

Definition at line 504 of file PlanRep.h.

void ogdf::PlanRep::setGeneralization ( edge e ) [inline]

Classifies edge e as generalization (primary type).

Definition at line 368 of file PlanRep.h.

void ogdf::PlanRep::setHalfBrother ( edge e ) [inline]

Classifies edge e as connection between ... (fourth level type).

Definition at line 446 of file PlanRep.h.

void ogdf::PlanRep::setPrimaryType	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 469 of file PlanRep.h.

void ogdf::PlanRep::setSecondaryType	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 472 of file PlanRep.h.

void ogdf::PlanRep::setType	(	edge	e,
		EdgeType	et
	)			`[inline]`

Set both type values of e at once.

This is a temporary solution that sets both type values; this way, all additional edge types in the new field are lost.

Parameters:

	e	is an edge in the planarized representation.
	et	is the type assigned to e.

Definition at line 341 of file PlanRep.h.

void ogdf::PlanRep::setUserType	(	edge	e,
		edgeType	et
	)			`[inline]`

Definition at line 482 of file PlanRep.h.

virtual edge ogdf::PlanRep::split ( edge e ) [virtual]

Splits edge e.

Reimplemented from ogdf::GraphCopy.

Reimplemented in ogdf::ClusterPlanRep, and ogdf::PlanRepUML.

Graph::NodeType ogdf::PlanRep::typeOf ( node v ) const [inline]

Returns the type of node v.

Parameters:

v

is a node in the planarized representation.

Definition at line 221 of file PlanRep.h.

EdgeType ogdf::PlanRep::typeOf ( edge e ) const [inline]

Returns the type of edge e.

Parameters:

e

is an edge in the planarized representation.

Definition at line 284 of file PlanRep.h.

Graph::NodeType& ogdf::PlanRep::typeOf ( node v ) [inline]

Returns a reference to the type of node v.

Parameters:

v

is a node in the planarized representation.

Definition at line 229 of file PlanRep.h.

EdgeType& ogdf::PlanRep::typeOf ( edge e ) [inline]

Returns a reference to the type of edge e.

Parameters:

e

is an edge in the planarized representation.

Definition at line 292 of file PlanRep.h.

EdgeType ogdf::PlanRep::typeOrig ( edge e ) const [inline]

Returns the type of original edge e.

Definition at line 551 of file PlanRep.h.

double ogdf::PlanRep::widthOrig ( node v ) const [inline]

Returns the width of original node v.

Definition at line 536 of file PlanRep.h.

const NodeArray<double>& ogdf::PlanRep::widthOrig ( ) const [inline]

Gives access to the node array of the widths of original nodes.

Definition at line 531 of file PlanRep.h.

Member Data Documentation

NodeArray<adjEntry> ogdf::PlanRep::m_boundaryAdj [protected]

Definition at line 738 of file PlanRep.h.

int ogdf::PlanRep::m_currentCC [protected]

The index of the current component.

Definition at line 697 of file PlanRep.h.

EdgeArray<edge> ogdf::PlanRep::m_eAuxCopy [protected]

Definition at line 757 of file PlanRep.h.

EdgeArray<edgeType> ogdf::PlanRep::m_edgeTypes [protected]

Definition at line 750 of file PlanRep.h.

EdgeArray<EdgeType> ogdf::PlanRep::m_eType [protected]

Definition at line 742 of file PlanRep.h.

NodeArray<adjEntry> ogdf::PlanRep::m_expandAdj [protected]

Definition at line 734 of file PlanRep.h.

NodeArray<node> ogdf::PlanRep::m_expandedNode [protected]

For all expansion nodes, save expanded node.

Definition at line 733 of file PlanRep.h.

EdgeArray<int> ogdf::PlanRep::m_expansionEdge [protected]

Definition at line 741 of file PlanRep.h.

Array<List<node> > ogdf::PlanRep::m_nodesInCC [protected]

The list of original nodes in each component.

Definition at line 700 of file PlanRep.h.

NodeArray<nodeType> ogdf::PlanRep::m_nodeTypes [protected]

Node types for extended semantic information.

Definition at line 731 of file PlanRep.h.

int ogdf::PlanRep::m_numCC [protected]

The number of components in the original graph.

Definition at line 698 of file PlanRep.h.

EdgeArray<edgeType> ogdf::PlanRep::m_oriEdgeTypes [protected]

Definition at line 755 of file PlanRep.h.

const GraphAttributes* ogdf::PlanRep::m_pGraphAttributes [protected]

Pointer to graph attributes of original graph.

Definition at line 702 of file PlanRep.h.

NodeArray<NodeType> ogdf::PlanRep::m_vType [protected]

Simple node types.

Definition at line 729 of file PlanRep.h.

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

ogdf/planarity/PlanRep.h

Open
Graph Drawing
Framework

ogdf::PlanRep Class Reference

Classes

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

OpenGraph DrawingFramework

ogdf::PlanRep Class Reference

Classes

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

Open
Graph Drawing
Framework