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
void	writeGML (const char *fileName, const OrthoRep &OR, const GridLayout &drawing)

void	writeGML (std::ostream &os, const OrthoRep &OR, const GridLayout &drawing)


	PlanRep (const Graph &G)
	Creates a planarized representation of graph `G`.

	PlanRep (const GraphAttributes &AG)
	Creates a planarized representation of graph `AG`.

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 CCsInfo &	ccInfo () const
	Returns the connected components info structure.

int	numberOfNodesInCC () const
	Returns the number of nodes in the current connected component.

int	numberOfNodesInCC (int cc) const
	Returns the number of nodes in connected component `cc`.

node	v (int i) const
	Returns node `i` in the list of all original nodes.

edge	e (int i) const
	Returns edge `i` in the list of all original edges.

int	startNode () const
	Returns the index of the first node in this connected component.

int	startNode (int cc) const
	Returns the index of the first node in connected component `cc`.

int	stopNode () const
	Returns the index of (one past) the last node in this connected component.

int	stopNode (int cc) const
	Returns the index of (one past) the last node in connected component `cc`.

int	startEdge () const
	Returns the index of the first edge in this connected component.

int	stopEdge () const
	Returns the index of (one past) the last edge in this connected component.

void	initCC (int cc)
	Initializes the planarized representation for connected component `cc`.

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
	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.

adjEntry &	boundaryAdj (node v)
	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.

void	setCliqueBoundary (edge e)

bool	isCliqueBoundary (edge e) const

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) const
	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) const
	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) const
	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) const
	Returns true iff edge `e` is classified as generalization.

void	setGeneralization (edge e)
	Classifies edge `e` as generalization (primary type).

bool	isDependency (edge e) const
	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) const
	Returns true iff edge `e` is classified as expansion edge.

bool	isBoundary (edge e) const
	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) const
	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) const
	Returns true if edge `e` is classified as brother.

bool	isHalfBrother (edge e) const
	Returns true if edge `e` is classified as half-brother.

edgeType	edgeTypeAND (edge e, edgeType et)
	Sets type of edge `e` to current type (bitwise) AND `et`.

edgeType	edgeTypeOR (edge e, edgeType et)
	Sets type of edge `e` to current type (bitwise) OR `et`.

void	setPrimaryType (edge e, edgeType et)
	Sets primary edge type of edge `e` to primary edge type in `et` (deletes old primary value).

void	setPrimaryType (edge e, UMLEdgeTypeConstants et)
	Sets primary edge type of edge `e` to primary edge type in `et` (deletes old primary value).

void	setSecondaryType (edge e, edgeType et)
	Sets secondary edge type of edge `e` to primary edge type in `et`.

edgeType	edgeTypePrimaryAND (edge e, edgeType et)
	Sets primary type of `e` to bitwise AND of `et's` primary value and old value.

edgeType	edgeTypePrimaryOR (edge e, edgeType et)
	Sets primary type of `e` to bitwise OR of `et's` primary value and old value.

void	setUserType (edge e, edgeType et)
	Sets user defined type locally.

bool	isUserType (edge e, edgeType et) const
	Returns user defined type.

void	setExpansionEdge (edge e, int expType)
	Sets the expansion edge type of `e` to `expType`.

bool	isExpansionEdge (edge e) const
	Returns if `e` is an expansion edge.

int	expansionType (edge e) const
	Returns the expansion edge type of `e`.

bool	isDegreeExpansionEdge (edge e) const
	Returns if `e` is a degree expansion edge.

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
virtual void	expand (bool lowDegreeExpand=false)

void	expandLowDegreeVertices (OrthoRep &OR)

void	collapseVertices (const OrthoRep &OR, Layout &drawing)

void	collapseVertices (const OrthoRep &OR, GridLayout &drawing)

void	removeCrossing (node v)

void	insertBoundary (node center, adjEntry &adjExternal)

Extension of methods defined by GraphCopys
virtual edge	split (edge e) override
	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
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)
	Same as insertEdgePath, but for embedded graphs.

void	removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)
	Removes the complete edge path for edge `eOrig` while preserving the embedding.

edge	insertCrossing (edge &crossingEdge, edge crossedEdge, bool topDown)
	Inserts crossings between two copy edges.

Degree-1 nodes
These methods realize a mechanism for temporarily removing degree-1 nodes.
void	removeDeg1Nodes (ArrayBuffer< Deg1RestoreInfo > &S, const NodeArray< bool > &mark)
	Removes all marked degree-1 nodes from the graph copy and stores restore information in `S`.

void	restoreDeg1Nodes (ArrayBuffer< Deg1RestoreInfo > &S, List< node > &deg1s)
	Restores degree-1 nodes previously removed with removeDeg1Nodes().

Public Member Functions inherited from ogdf::GraphCopy
	GraphCopy ()
	Default constructor (does nothing!).

	GraphCopy (const Graph &G)
	Creates a graph copy of `G`.

	GraphCopy (const GraphCopy &GC)
	Copy constructor.

virtual	~GraphCopy ()

const Graph &	original () const
	Returns a reference to the original graph.

node	original (node v) const
	Returns the node in the original graph corresponding to `v`.

edge	original (edge e) const
	Returns the edge in the original graph corresponding to `e`.

adjEntry	original (adjEntry adj) const
	Returns the adjacency entry in the original graph corresponding to `adj`.

node	copy (node v) const
	Returns the node in the graph copy corresponding to `v`.

const List< edge > &	chain (edge e) const
	Returns the list of edges coresponding to edge `e`.

edge	copy (edge e) const
	Returns the first edge in the list of edges coresponding to edge `e`.

adjEntry	copy (adjEntry adj) const
	Returns the adjacency entry in the copy graph corresponding to `adj`.

bool	isDummy (node v) const
	Returns true iff `v` has no corresponding node in the original graph.

bool	isDummy (edge e) const
	Returns true iff `e` has no corresponding edge in the original graph.

bool	isReversed (edge e) const
	Returns true iff edge `e` has been reversed.

bool	isReversedCopyEdge (edge e) const
	Returns true iff `e` is reversed w.r.t.

node	newNode (node vOrig)
	Creates a new node in the graph copy with original node `vOrig`.

virtual void	delNode (node v) override
	Removes node `v` and all its adjacent edges cleaning-up their corresponding lists of original edges.

virtual void	delEdge (edge e) override
	Removes edge e and clears the list of edges corresponding to `e's` original edge.

virtual void	clear () override
	Removes all nodes and all edges from the graph.

void	unsplit (edge eIn, edge eOut) override
	Undoes a previous split operation.

edge	newEdge (edge eOrig)
	Creates a new edge (v,w) with original edge eOrig.

void	setEdge (edge eOrig, edge eCopy)
	sets eOrig to be the corresponding original edge of eCopy and vice versa

bool	embed ()
	Embeds the graph copy.

void	removePseudoCrossings ()
	Removes all crossing nodes which are actually only two "touching" edges.

bool	hasSameEdgesCrossings () const
	Returns whether there are two edges in the GraphCopy that cross each other multiple times.

bool	hasAdjacentEdgesCrossings () const
	Returns whether the GraphCopy contains at least one crossing of two adjacent edges.

bool	hasNonSimpleCrossings () const
	Returns whether the GraphCopy contains crossings that will result in a non-simple drawing.

void	removeNonSimpleCrossings (SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr)
	Removes all non-simple cossings involving edges from `edgesToCheck` (see hasNonSimpleCrossings() for a definition of non-simple crossings).

void	removeNonSimpleCrossings (DynamicDualGraph *dualGraph=nullptr)
	Removes all non-simple cossings (see hasNonSimpleCrossings() for a definition of non-simple crossings).

void	removeNonSimpleCrossings (node origNode, DynamicDualGraph *dualGraph=nullptr)
	Removes all non-simple cossings involving edges incident to `origNode` (see hasNonSimpleCrossings() for a definition of non-simple crossings).

void	insertEdgePath (edge eOrig, const SList< adjEntry > &crossedEdges)
	Re-inserts edge `eOrig` by "crossing" the edges in `crossedEdges`.

void	insertEdgePath (node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)
	Special version (for FixedEmbeddingUpwardEdgeInserter only).

void	removeEdgePath (edge eOrig)
	Removes the complete edge path for edge `eOrig`.

edge	insertCrossing (edge &crossingEdge, edge crossedEdge, bool rightToLeft)
	Inserts crossings between two copy edges.

node	newNode ()
	Creates a new node and returns it.

node	newNode (int index)
	Creates a new node with predefined index and returns it.

edge	newEdge (node v, node w)
	Creates a new edge (`v`,`w`) and returns it.

edge	newEdge (node v, node w, int index)
	Creates a new edge (`v`,`w`) with predefined index and returns it.

edge	newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)
	Creates a new edge at predefined positions in the adjacency lists.

edge	newEdge (node v, adjEntry adjTgt)
	Creates a new edge at predefined positions in the adjacency lists.

edge	newEdge (adjEntry adjSrc, node w)
	Creates a new edge at predefined positions in the adjacency lists.

edge	newEdge (node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E)
	Creates a new edge with original edge `eOrig` in an embedding `E`.

void	setOriginalEmbedding ()
	Sets the embedding of the graph copy to the embedding of the original graph.

void	insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
	Re-inserts edge `eOrig` by "crossing" the edges in `crossedEdges` in embedding `E`.

void	insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges)

void	removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)
	Removes the complete edge path for edge `eOrig` while preserving the embedding.

void	removeEdgePathEmbedded (CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig)

void	init (const Graph &G)
	Re-initializes the copy using the graph `G`.

void	createEmpty (const Graph &G)
	Associates the graph copy with `G`, but does not create any nodes or edges.

void	initByCC (const CCsInfo &info, int cc, EdgeArray< edge > &eCopy)
	Initializes the graph copy for the nodes in component `cc`.

void	initByNodes (const List< node > &origNodes, EdgeArray< edge > &eCopy)
	Initializes the graph copy for the nodes in a component.

void	initByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy)
	Initializes the graph copy for the nodes in `nodeList`.

GraphCopy &	operator= (const GraphCopy &GC)
	Assignment operator.

Public Member Functions inherited from ogdf::Graph
	Graph ()
	Constructs an empty graph.

	Graph (const Graph &G)
	Constructs a graph that is a copy of `G`.

virtual	~Graph ()
	Destructor.

bool	empty () const
	Returns true iff the graph is empty, i.e., contains no nodes.

int	numberOfNodes () const
	Returns the number of nodes in the graph.

int	numberOfEdges () const
	Returns the number of edges in the graph.

int	maxNodeIndex () const
	Returns the largest used node index.

int	maxEdgeIndex () const
	Returns the largest used edge index.

int	maxAdjEntryIndex () const
	Returns the largest used adjEntry index.

int	nodeArrayTableSize () const
	Returns the table size of node arrays associated with this graph.

int	edgeArrayTableSize () const
	Returns the table size of edge arrays associated with this graph.

int	adjEntryArrayTableSize () const
	Returns the table size of adjEntry arrays associated with this graph.

node	firstNode () const
	Returns the first node in the list of all nodes.

node	lastNode () const
	Returns the last node in the list of all nodes.

edge	firstEdge () const
	Returns the first edge in the list of all edges.

edge	lastEdge () const
	Returns the last edge in the list of all edges.

node	chooseNode (std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const
	Returns a random node.

edge	chooseEdge (std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const
	Returns a random edge.

template<class CONTAINER >
void	allNodes (CONTAINER &nodeContainer) const
	Returns a container with all nodes of the graph.

template<class CONTAINER >
void	allEdges (CONTAINER &edgeContainer) const
	Returns a container with all edges of the graph.

node	newNode ()
	Creates a new node and returns it.

node	newNode (int index)
	Creates a new node with predefined index and returns it.

edge	newEdge (node v, node w)
	Creates a new edge (`v`,`w`) and returns it.

edge	newEdge (node v, node w, int index)
	Creates a new edge (`v`,`w`) with predefined index and returns it.

edge	newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)
	Creates a new edge at predefined positions in the adjacency lists.

edge	newEdge (node v, adjEntry adjTgt)
	Creates a new edge at predefined positions in the adjacency lists.

edge	newEdge (adjEntry adjSrc, node w)
	Creates a new edge at predefined positions in the adjacency lists.

void	insert (const Graph &G, NodeArray< node > &nodeMap)
	Inserts Graph `G` as a subgraph into this Graph.

void	insert (const Graph &G)
	Inserts Graph `G` as a subgraph into this Graph.

void	unsplit (node u)
	Undoes a split operation.

node	splitNode (adjEntry adjStartLeft, adjEntry adjStartRight)
	Splits a node while preserving the order of adjacency entries.

node	contract (edge e, bool keepSelfLoops=false)
	Contracts edge `e` while preserving the order of adjacency entries.

void	move (edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)
	Moves edge `e` to a different adjacency list.

void	moveTarget (edge e, node w)
	Moves the target node of edge `e` to node `w`.

void	moveTarget (edge e, adjEntry adjTgt, Direction dir)
	Moves the target node of edge `e` to a specific position in an adjacency list.

void	moveSource (edge e, node w)
	Moves the source node of edge `e` to node `w`.

void	moveSource (edge e, adjEntry adjSrc, Direction dir)
	Moves the source node of edge `e` to a specific position in an adjacency list.

edge	searchEdge (node v, node w, bool directed=false) const
	Searches and returns an edge connecting nodes `v` and `w` in time O( min(deg(`v` ), deg(`w` ))).

void	reverseEdge (edge e)
	Reverses the edge `e`, i.e., exchanges source and target node.

void	reverseAllEdges ()
	Reverses all edges in the graph.

template<class NODELIST >
void	collapse (NODELIST &nodesToCollapse)
	Collapses all nodes in the list `nodesToCollapse` to the first node in the list.

template<class ADJ_ENTRY_LIST >
void	sort (node v, const ADJ_ENTRY_LIST &newOrder)
	Sorts the adjacency list of node `v` according to `newOrder`.

void	reverseAdjEdges (node v)
	Reverses the adjacency list of `v`.

void	moveAdj (adjEntry adjMove, Direction dir, adjEntry adjPos)
	Moves adjacency entry `adjMove` before or after `adjPos`.

void	moveAdjAfter (adjEntry adjMove, adjEntry adjAfter)
	Moves adjacency entry `adjMove` after `adjAfter`.

void	moveAdjBefore (adjEntry adjMove, adjEntry adjBefore)
	Moves adjacency entry `adjMove` before `adjBefore`.

void	reverseAdjEdges ()
	Reverses all adjacency lists.

void	swapAdjEdges (adjEntry adj1, adjEntry adj2)
	Exchanges two entries in an adjacency list.

int	genus () const
	Returns the genus of the graph's embedding.

bool	representsCombEmbedding () const
	Returns true iff the graph represents a combinatorial embedding.

ListIterator< NodeArrayBase * >	registerArray (NodeArrayBase *pNodeArray) const
	Registers a node array.

ListIterator< EdgeArrayBase * >	registerArray (EdgeArrayBase *pEdgeArray) const
	Registers an edge array.

ListIterator< AdjEntryArrayBase * >	registerArray (AdjEntryArrayBase *pAdjArray) const
	Registers an adjEntry array.

ListIterator< GraphObserver * >	registerStructure (GraphObserver *pStructure) const
	Registers a graph observer (e.g. a ClusterGraph).

void	unregisterArray (ListIterator< NodeArrayBase * > it) const
	Unregisters a node array.

void	unregisterArray (ListIterator< EdgeArrayBase * > it) const
	Unregisters an edge array.

void	unregisterArray (ListIterator< AdjEntryArrayBase * > it) const
	Unregisters an adjEntry array.

void	unregisterStructure (ListIterator< GraphObserver * > it) const
	Unregisters a graph observer.

template<class ArrayBase >
void	moveRegisterArray (ListIterator< ArrayBase * > it, ArrayBase *pArray) const
	Move the registration `it` of an graph element array to `pArray` (used with move semantics for graph element arrays).

void	resetEdgeIdCount (int maxId)
	Resets the edge id count to `maxId`.

Graph &	operator= (const Graph &G)
	Assignment operator.

Protected Member Functions
edgeType	assClassPattern () const

edgeType	associationPattern () const

edgeType	brotherPattern () const

edgeType	cliquePattern () const

edgeType	expansionPattern () const

edgeType	generalizationPattern () const

edgeType	halfBrotherPattern () const

void	setCopyType (edge eCopy, edge eOrig)

Protected Member Functions inherited from ogdf::GraphCopy
void	removeAdjacentEdgesCrossing (adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph)
	Removes the crossing of the two adjacent edges adj1->theEdge() and adj2->theEdge().

void	removeSameEdgesCrossing (adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph)
	Removes the two crossings given by the adjEntries, assuming that both crossings stem from the same two edges.

void	removeUnnecessaryCrossing (adjEntry adj, DynamicDualGraph *dualGraph)
	Removes the pseudo crossing that adj belongs to.

void	removeUnnecessaryCrossing (adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)

void	setOriginalEdgeAlongCrossings (adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2)
	Sets the original edges from adjCopy1 up to vCopy to eOrig2, and the original edges from adjCopy2 up to vCopy to eOrig1.

void	swapOriginalEdgesAtCrossing (adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr)
	Swaps the original edges from adjCopy1 up to the common node of {adjCopy1, adjCopy2} with the original edges from adjCopy2 up to the same common node.

void	swapOriginalEdgesBetweenCrossings (adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr)
	Swaps the original edges from adjFirstCrossing1 up to adjSecondCrossing1->theNode() with the original edges from adjFirstCrossing2 up to adjSecondCrossing2->theNode().

Protected Member Functions inherited from ogdf::Graph
void	assign (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void	construct (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void	constructInitByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void	constructInitByCC (const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
	Constructs a copy of connected component `cc` in `info`.

void	constructInitByNodes (const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
	Constructs a copy of the subgraph of `G` induced by `nodeList`.

Protected Attributes
NodeArray< adjEntry >	m_boundaryAdj

Graph::CCsInfo	m_ccInfo

int	m_currentCC
	The index of the current component.

EdgeArray< edge >	m_eAuxCopy

EdgeArray< edgeType >	m_edgeTypes

EdgeArray< EdgeType >	m_eType

NodeArray< adjEntry >	m_expandAdj

NodeArray< node >	m_expandedNode
	For all expansion nodes, save expanded node.

EdgeArray< int >	m_expansionEdge

NodeArray< nodeType >	m_nodeTypes
	Node types for extended semantic information.

EdgeArray< edgeType >	m_oriEdgeTypes

const GraphAttributes *	m_pGraphAttributes
	Pointer to graph attributes of original graph.

NodeArray< NodeType >	m_vType
	Simple node types.

Protected Attributes inherited from ogdf::GraphCopy
EdgeArray< List< edge > >	m_eCopy
	The corresponding list of edges in the graph copy.

EdgeArray< ListIterator< edge > >	m_eIterator
	The position of copy edge in the list.

EdgeArray< edge >	m_eOrig
	The corresponding edge in the original graph.

const Graph *	m_pGraph
	The original graph.

NodeArray< node >	m_vCopy
	The corresponding node in the graph copy.

NodeArray< node >	m_vOrig
	The corresponding node in the original graph.

Additional Inherited Members
Public Types inherited from ogdf::Graph
enum class	EdgeType { association = 0 , generalization = 1 , dependency = 2 }
	The type of edges (only used in derived classes). More...

enum class	NodeType { vertex = 0 , dummy = 1 , generalizationMerger = 2 , generalizationExpander = 3 , highDegreeExpander = 4 , lowDegreeExpander = 5 , associationClass = 6 }
	The type of nodes. More...

using	node_iterator = internal::GraphIterator< node >
	Provides a bidirectional iterator to a node in a graph.

using	edge_iterator = internal::GraphIterator< edge >
	Provides a bidirectional iterator to an edge in a graph.

using	adjEntry_iterator = internal::GraphIterator< adjEntry >
	Provides a bidirectional iterator to an entry in an adjacency list.

Public Attributes inherited from ogdf::Graph
internal::GraphObjectContainer< NodeElement >	nodes
	The container containing all node objects.

internal::GraphObjectContainer< EdgeElement >	edges
	The container containing all edge objects.

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 57 of file PlanRep.h.

Constructor & Destructor Documentation

◆ PlanRep() [1/2]

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

explicit

Creates a planarized representation of graph G.

◆ PlanRep() [2/2]

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

explicit

Creates a planarized representation of graph AG.

◆ ~PlanRep()

virtual ogdf::PlanRep::~PlanRep ( )

inlinevirtual

Definition at line 78 of file PlanRep.h.

Member Function Documentation

◆ assClassPattern()

edgeType ogdf::PlanRep::assClassPattern ( ) const

inlineprotected

Definition at line 693 of file PlanRep.h.

◆ associationPattern()

edgeType ogdf::PlanRep::associationPattern ( ) const

inlineprotected

Definition at line 685 of file PlanRep.h.

◆ boundaryAdj() [1/2]

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 169 of file PlanRep.h.

◆ boundaryAdj() [2/2]

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 163 of file PlanRep.h.

◆ brotherPattern()

edgeType ogdf::PlanRep::brotherPattern ( ) const

inlineprotected

Definition at line 697 of file PlanRep.h.

◆ ccInfo()

const CCsInfo & ogdf::PlanRep::ccInfo ( ) const

inline

Returns the connected components info structure.

Definition at line 96 of file PlanRep.h.

◆ cliquePattern()

edgeType ogdf::PlanRep::cliquePattern ( ) const

inlineprotected

Definition at line 705 of file PlanRep.h.

◆ collapseVertices() [1/2]

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

◆ collapseVertices() [2/2]

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

◆ currentCC()

int ogdf::PlanRep::currentCC ( ) const

inline

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

Definition at line 93 of file PlanRep.h.

◆ e()

edge ogdf::PlanRep::e ( int i ) const

inline

Returns edge i in the list of all original edges.

Definition at line 108 of file PlanRep.h.

◆ edgeTypeAND()

edgeType ogdf::PlanRep::edgeTypeAND	(	edge	e,
		edgeType	et
	)

inline

Sets type of edge e to current type (bitwise) AND et.

Definition at line 401 of file PlanRep.h.

◆ edgeTypeOf()

edgeType ogdf::PlanRep::edgeTypeOf ( edge e ) const

inline

Returns the new type field of e.

Parameters

e	is an edge in the planarized representation.

Definition at line 259 of file PlanRep.h.

◆ edgeTypeOR()

edgeType ogdf::PlanRep::edgeTypeOR	(	edge	e,
		edgeType	et
	)

inline

Sets type of edge e to current type (bitwise) OR et.

Definition at line 407 of file PlanRep.h.

◆ edgeTypePrimaryAND()

edgeType ogdf::PlanRep::edgeTypePrimaryAND	(	edge	e,
		edgeType	et
	)

inline

Sets primary type of e to bitwise AND of et's primary value and old value.

Definition at line 430 of file PlanRep.h.

◆ edgeTypePrimaryOR()

edgeType ogdf::PlanRep::edgeTypePrimaryOR	(	edge	e,
		edgeType	et
	)

inline

Sets primary type of e to bitwise OR of et's primary value and old value.

Definition at line 436 of file PlanRep.h.

◆ edgeTypes()

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 265 of file PlanRep.h.

◆ expand()

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

virtual

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

◆ expandAdj() [1/2]

adjEntry & ogdf::PlanRep::expandAdj ( node v )

inline

Definition at line 151 of file PlanRep.h.

◆ expandAdj() [2/2]

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 149 of file PlanRep.h.

◆ expandedNode()

node ogdf::PlanRep::expandedNode ( node v ) const

inline

Definition at line 558 of file PlanRep.h.

◆ expandLowDegreeVertices()

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

◆ expansionPattern()

edgeType ogdf::PlanRep::expansionPattern ( ) const

inlineprotected

Definition at line 689 of file PlanRep.h.

◆ expansionType()

int ogdf::PlanRep::expansionType ( edge e ) const

inline

Returns the expansion edge type of e.

Definition at line 470 of file PlanRep.h.

◆ generalizationPattern()

edgeType ogdf::PlanRep::generalizationPattern ( ) const

inlineprotected

Definition at line 681 of file PlanRep.h.

◆ getGraphAttributes()

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

inline

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

Definition at line 522 of file PlanRep.h.

◆ halfBrotherPattern()

edgeType ogdf::PlanRep::halfBrotherPattern ( ) const

inlineprotected

Definition at line 701 of file PlanRep.h.

◆ heightOrig() [1/2]

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

inline

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

Definition at line 504 of file PlanRep.h.

◆ heightOrig() [2/2]

double ogdf::PlanRep::heightOrig ( node v ) const

inline

Returns the height of original node v.

Definition at line 510 of file PlanRep.h.

◆ initCC()

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

Initializes the planarized representation for connected component cc.

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

◆ insertBoundary()

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

◆ insertCrossing()

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

Inserts crossings between two copy edges.

This method is used in TopologyModule.

Let crossingEdge = (a, b) and crossedEdge = (v, w). Then crossedEdge is split creating two edges crossedEdge = (v, u) and (u, w), crossingEdge is removed and replaced by two new edges e1 = (a, u) and e1 = (u, b). Finally it sets crossingEdge to e2 and returns (u, w).

Parameters

crossingEdge	is the edge that gets split.
crossedEdge	is the edge that is replaced by two new edges.
topDown	is used as follows: If set to true, `crossingEdge` will cross `crossedEdge` from right to left, otherwise from left to right.

◆ insertEdgePath()

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

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

Splits each edge in crossedEdges.

Precondition: eOrig is an edge in the original graph and the edges in crossedEdges are in this graph.

◆ insertEdgePathEmbedded()

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

Same as insertEdgePath, but for embedded graphs.

◆ isAssClass()

bool ogdf::PlanRep::isAssClass ( edge e ) const

inline

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

Definition at line 372 of file PlanRep.h.

◆ isBoundary()

bool ogdf::PlanRep::isBoundary ( edge e ) const

inline

Returns true iff edge e is a clique boundary.

Definition at line 364 of file PlanRep.h.

◆ isBrother()

bool ogdf::PlanRep::isBrother ( edge e ) const

inline

Returns true if edge e is classified as brother.

Definition at line 385 of file PlanRep.h.

◆ isCliqueBoundary()

bool ogdf::PlanRep::isCliqueBoundary ( edge e ) const

inline

Definition at line 174 of file PlanRep.h.

◆ isCrossingType()

bool ogdf::PlanRep::isCrossingType ( node v ) const

inline

Returns true iff node v is classified as a crossing.

Parameters

v	is a node in the planarized representation.

Definition at line 226 of file PlanRep.h.

◆ isDegreeExpansionEdge()

bool ogdf::PlanRep::isDegreeExpansionEdge ( edge e ) const

inline

Returns if e is a degree expansion edge.

Definition at line 474 of file PlanRep.h.

◆ isDependency()

bool ogdf::PlanRep::isDependency ( edge e ) const

inline

Returns true iff edge e is classified as dependency.

Definition at line 321 of file PlanRep.h.

◆ isExpansion()

bool ogdf::PlanRep::isExpansion ( edge e ) const

inline

Returns true iff edge e is classified as expansion edge.

Definition at line 357 of file PlanRep.h.

◆ isExpansionEdge()

bool ogdf::PlanRep::isExpansionEdge ( edge e ) const

inline

Returns if e is an expansion edge.

Definition at line 467 of file PlanRep.h.

◆ isGeneralization()

bool ogdf::PlanRep::isGeneralization ( edge e ) const

inline

Returns true iff edge e is classified as generalization.

Definition at line 305 of file PlanRep.h.

◆ isHalfBrother()

bool ogdf::PlanRep::isHalfBrother ( edge e ) const

inline

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

Definition at line 392 of file PlanRep.h.

◆ isUserType()

bool ogdf::PlanRep::isUserType	(	edge	e,
		edgeType	et
	)		const

inline

Returns user defined type.

Definition at line 448 of file PlanRep.h.

◆ isVertex()

bool ogdf::PlanRep::isVertex ( node v ) const

inline

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

Definition at line 204 of file PlanRep.h.

◆ newCopy() [1/3]

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.

◆ newCopy() [2/3]

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.

◆ newCopy() [3/3]

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.

◆ nodeTypeOf()

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 212 of file PlanRep.h.

◆ numberOfCCs()

int ogdf::PlanRep::numberOfCCs ( ) const

inline

Returns the number of connected components in the original graph.

Definition at line 90 of file PlanRep.h.

◆ numberOfNodesInCC() [1/2]

int ogdf::PlanRep::numberOfNodesInCC ( ) const

inline

Returns the number of nodes in the current connected component.

Definition at line 99 of file PlanRep.h.

◆ numberOfNodesInCC() [2/2]

int ogdf::PlanRep::numberOfNodesInCC ( int cc ) const

inline

Returns the number of nodes in connected component cc.

Definition at line 102 of file PlanRep.h.

◆ oriEdgeTypes()

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 253 of file PlanRep.h.

◆ removeCrossing()

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

◆ removeDeg1Nodes()

void ogdf::PlanRep::removeDeg1Nodes	(	ArrayBuffer< 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[a]=true are removed.

Precondition: Only nodes with degree 1 may be marked.

◆ removeEdgePathEmbedded()

void ogdf::PlanRep::removeEdgePathEmbedded	(	CombinatorialEmbedding &	E,
		edge	eOrig,
		FaceSet< false > &	newFaces
	)

inline

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

Precondition: eOrig s an edge in the original graph.

Definition at line 617 of file PlanRep.h.

◆ restoreDeg1Nodes()

void ogdf::PlanRep::restoreDeg1Nodes	(	ArrayBuffer< 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.

◆ setAssClass()

void ogdf::PlanRep::setAssClass ( edge e )

inline

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

Definition at line 369 of file PlanRep.h.

◆ setAssociation()

void ogdf::PlanRep::setAssociation ( edge e )

inline

Classifies edge e as association (primary type).

Definition at line 337 of file PlanRep.h.

◆ setBrother()

void ogdf::PlanRep::setBrother ( edge e )

inline

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

Definition at line 379 of file PlanRep.h.

◆ setCliqueBoundary()

void ogdf::PlanRep::setCliqueBoundary ( edge e )

inline

Definition at line 172 of file PlanRep.h.

◆ setCopyType()

void ogdf::PlanRep::setCopyType	(	edge	eCopy,
		edge	eOrig
	)

protected

◆ setCrossingType()

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 218 of file PlanRep.h.

◆ setDependency()

void ogdf::PlanRep::setDependency ( edge e )

inline

Classifies edge e as dependency (primary type).

Definition at line 329 of file PlanRep.h.

◆ setEdgeTypeOf()

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 272 of file PlanRep.h.

◆ setExpandedNode()

void ogdf::PlanRep::setExpandedNode	(	node	v,
		node	w
	)

inline

Definition at line 560 of file PlanRep.h.

◆ setExpansion()

void ogdf::PlanRep::setExpansion ( edge e )

inline

Classifies edge e as expansion edge (secondary type).

Definition at line 349 of file PlanRep.h.

◆ setExpansionEdge()

void ogdf::PlanRep::setExpansionEdge	(	edge	e,
		int	expType
	)

inline

Sets the expansion edge type of e to expType.

Definition at line 464 of file PlanRep.h.

◆ setGeneralization()

void ogdf::PlanRep::setGeneralization ( edge e )

inline

Classifies edge e as generalization (primary type).

Definition at line 313 of file PlanRep.h.

◆ setHalfBrother()

void ogdf::PlanRep::setHalfBrother ( edge e )

inline

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

Definition at line 382 of file PlanRep.h.

◆ setPrimaryType() [1/2]

void ogdf::PlanRep::setPrimaryType	(	edge	e,
		edgeType	et
	)

inline

Sets primary edge type of edge e to primary edge type in et (deletes old primary value).

Definition at line 413 of file PlanRep.h.

◆ setPrimaryType() [2/2]

void ogdf::PlanRep::setPrimaryType	(	edge	e,
		UMLEdgeTypeConstants	et
	)

inline

Sets primary edge type of edge e to primary edge type in et (deletes old primary value).

Definition at line 419 of file PlanRep.h.

◆ setSecondaryType()

void ogdf::PlanRep::setSecondaryType	(	edge	e,
		edgeType	et
	)

inline

Sets secondary edge type of edge e to primary edge type in et.

Definition at line 424 of file PlanRep.h.

◆ setType()

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 282 of file PlanRep.h.

◆ setUserType()

void ogdf::PlanRep::setUserType	(	edge	e,
		edgeType	et
	)

inline

Sets user defined type locally.

Definition at line 442 of file PlanRep.h.

◆ split()

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

overridevirtual

Splits edge e.

Reimplemented from ogdf::GraphCopy.

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

◆ startEdge()

int ogdf::PlanRep::startEdge ( ) const

inline

Returns the index of the first edge in this connected component.

Definition at line 123 of file PlanRep.h.

◆ startNode() [1/2]

int ogdf::PlanRep::startNode ( ) const

inline

Returns the index of the first node in this connected component.

Definition at line 111 of file PlanRep.h.

◆ startNode() [2/2]

int ogdf::PlanRep::startNode ( int cc ) const

inline

Returns the index of the first node in connected component cc.

Definition at line 114 of file PlanRep.h.

◆ stopEdge()

int ogdf::PlanRep::stopEdge ( ) const

inline

Returns the index of (one past) the last edge in this connected component.

Definition at line 126 of file PlanRep.h.

◆ stopNode() [1/2]

int ogdf::PlanRep::stopNode ( ) const

inline

Returns the index of (one past) the last node in this connected component.

Definition at line 117 of file PlanRep.h.

◆ stopNode() [2/2]

int ogdf::PlanRep::stopNode ( int cc ) const

inline

Returns the index of (one past) the last node in connected component cc.

Definition at line 120 of file PlanRep.h.

◆ typeOf() [1/4]

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 247 of file PlanRep.h.

◆ typeOf() [2/4]

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 241 of file PlanRep.h.

◆ typeOf() [3/4]

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 194 of file PlanRep.h.

◆ typeOf() [4/4]

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 188 of file PlanRep.h.

◆ typeOrig()

EdgeType ogdf::PlanRep::typeOrig ( edge e ) const

inline

Returns the type of original edge e.

Definition at line 516 of file PlanRep.h.

◆ v()

node ogdf::PlanRep::v ( int i ) const

inline

Returns node i in the list of all original nodes.

Definition at line 105 of file PlanRep.h.

◆ widthOrig() [1/2]

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

inline

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

Definition at line 492 of file PlanRep.h.

◆ widthOrig() [2/2]

double ogdf::PlanRep::widthOrig ( node v ) const

inline

Returns the width of original node v.

Definition at line 498 of file PlanRep.h.

◆ writeGML() [1/2]

void ogdf::PlanRep::writeGML	(	const char *	fileName,
		const OrthoRep &	OR,
		const GridLayout &	drawing
	)

◆ writeGML() [2/2]

void ogdf::PlanRep::writeGML	(	std::ostream &	os,
		const OrthoRep &	OR,
		const GridLayout &	drawing
	)

Member Data Documentation

◆ m_boundaryAdj

NodeArray<adjEntry> ogdf::PlanRep::m_boundaryAdj

protected

Definition at line 718 of file PlanRep.h.

◆ m_ccInfo

Graph::CCsInfo ogdf::PlanRep::m_ccInfo

protected

Definition at line 667 of file PlanRep.h.

◆ m_currentCC

int ogdf::PlanRep::m_currentCC

protected

The index of the current component.

Definition at line 666 of file PlanRep.h.

◆ m_eAuxCopy

EdgeArray<edge> ogdf::PlanRep::m_eAuxCopy

protected

Definition at line 737 of file PlanRep.h.

◆ m_edgeTypes

EdgeArray<edgeType> ogdf::PlanRep::m_edgeTypes

protected

Definition at line 730 of file PlanRep.h.

◆ m_eType

EdgeArray<EdgeType> ogdf::PlanRep::m_eType

protected

Definition at line 722 of file PlanRep.h.

◆ m_expandAdj

NodeArray<adjEntry> ogdf::PlanRep::m_expandAdj

protected

Definition at line 714 of file PlanRep.h.

◆ m_expandedNode

NodeArray<node> ogdf::PlanRep::m_expandedNode

protected

For all expansion nodes, save expanded node.

Definition at line 713 of file PlanRep.h.

◆ m_expansionEdge

EdgeArray<int> ogdf::PlanRep::m_expansionEdge

protected

Definition at line 721 of file PlanRep.h.

◆ m_nodeTypes

NodeArray<nodeType> ogdf::PlanRep::m_nodeTypes

protected

Node types for extended semantic information.

Definition at line 711 of file PlanRep.h.

◆ m_oriEdgeTypes

EdgeArray<edgeType> ogdf::PlanRep::m_oriEdgeTypes

protected

Definition at line 735 of file PlanRep.h.

◆ m_pGraphAttributes

const GraphAttributes* ogdf::PlanRep::m_pGraphAttributes

protected

Pointer to graph attributes of original graph.

Definition at line 672 of file PlanRep.h.

◆ m_vType

NodeArray<NodeType> ogdf::PlanRep::m_vType

protected

Simple node types.

Definition at line 709 of file PlanRep.h.

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

include/ogdf/planarity/PlanRep.h

OpenGraph DrawingFramework

Classes

Public Member Functions

Protected Member Functions

Protected Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ PlanRep() [1/2]

◆ PlanRep() [2/2]

◆ ~PlanRep()

Member Function Documentation

◆ assClassPattern()

◆ associationPattern()

◆ boundaryAdj() [1/2]

◆ boundaryAdj() [2/2]

◆ brotherPattern()

◆ ccInfo()

◆ cliquePattern()

◆ collapseVertices() [1/2]

◆ collapseVertices() [2/2]

◆ currentCC()

◆ e()

◆ edgeTypeAND()

◆ edgeTypeOf()

◆ edgeTypeOR()

◆ edgeTypePrimaryAND()

◆ edgeTypePrimaryOR()

◆ edgeTypes()

◆ expand()

◆ expandAdj() [1/2]

◆ expandAdj() [2/2]

◆ expandedNode()

◆ expandLowDegreeVertices()

◆ expansionPattern()

◆ expansionType()

◆ generalizationPattern()

◆ getGraphAttributes()

◆ halfBrotherPattern()

◆ heightOrig() [1/2]

◆ heightOrig() [2/2]

◆ initCC()

◆ insertBoundary()

◆ insertCrossing()

◆ insertEdgePath()

◆ insertEdgePathEmbedded()

◆ isAssClass()

◆ isBoundary()

◆ isBrother()

◆ isCliqueBoundary()

◆ isCrossingType()

◆ isDegreeExpansionEdge()

◆ isDependency()

◆ isExpansion()

◆ isExpansionEdge()

◆ isGeneralization()

◆ isHalfBrother()

◆ isUserType()

◆ isVertex()

◆ newCopy() [1/3]

◆ newCopy() [2/3]

◆ newCopy() [3/3]

◆ nodeTypeOf()

◆ numberOfCCs()

◆ numberOfNodesInCC() [1/2]

◆ numberOfNodesInCC() [2/2]

◆ oriEdgeTypes()

◆ removeCrossing()

◆ removeDeg1Nodes()

◆ removeEdgePathEmbedded()

◆ restoreDeg1Nodes()

◆ setAssClass()

◆ setAssociation()

◆ setBrother()

◆ setCliqueBoundary()

◆ setCopyType()

◆ setCrossingType()

◆ setDependency()

◆ setEdgeTypeOf()

◆ setExpandedNode()

Open
Graph Drawing
Framework