OpenGraph DrawingFramework

v.2012.07

ogdf::PlanRep Class Reference

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

#include <ogdf/planarity/PlanRep.h>

Inheritance diagram for ogdf::PlanRep:

List of all members.

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
Returns the adjacency entry of a node of an expanded face.
Clique boundary
void setCliqueBoundary (edge e)
bool isCliqueBoundary (edge e)
Node types
Graph::NodeType typeOf (node v) const
Returns the type of node v.
Graph::NodeTypetypeOf (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.
EdgeTypetypeOf (edge e)
Returns a reference to the type of edge e.
edgeTypeoriEdgeTypes (edge e)
Returns a reference to the type of original edge e.
edgeType edgeTypeOf (edge e)
Returns the new type field of e.
edgeTypeedgeTypes (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

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 GraphAttributesgetGraphAttributes () 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)
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.
Creates a new edge in the planarized representation.
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, 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 (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().
Public Member Functions inherited from ogdf::GraphCopy
GraphCopy (const Graph &G)
Creates a graph copy of G.
GraphCopy ()
Default constructor (does nothing!).
GraphCopy (const GraphCopy &GC)
Copy constructor.
virtual ~GraphCopy ()
const Graphoriginal () 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.
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.
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.
node newNode ()
Creates a new node in the graph copy.
node newNode (node vOrig)
Creates a new node in the graph copy with original node vOrig.
void delCopy (node v)
Removes node v and all its adjacent edges cleaning-up their corresponding lists of original edges.
void delCopy (edge e)
Removes edge e and clears the list of edges corresponding to e's original edge.
void unsplit (edge eIn, edge eOut)
Undoes a previous split operation. The two edges eIn and eOut are merged to a single edge eIn.
edge newEdge (edge eOrig)
Creates a new edge (v,w) with original edge eOrig.
Creates a new edge with original edge eOrig at predefined positions in the adjacency lists.
Creates a new edge with original edge eOrig at predefined positions in the adjacency lists.
edge newEdge (node v, node w)
Creates a new edge (v,w) and returns it.
Creates a new edge at predefined positions in the adjacency lists.
Creates a new edge at predefined positions in the adjacency lists.
void setEdge (edge eOrig, edge eCopy)
sets eOrig to be the corresponding original edge of eCopy and vice versa
void insertEdgePath (node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)
void removeEdgePath (edge eOrig)
Removes the complete edge path for edge eOrig.
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.
bool consistencyCheck () const
Checks the consistency of the data structure (for debugging only).
void createEmpty (const Graph &G)
Associates the graph copy with G, but does not create any nodes or edges.
void initByNodes (const List< node > &nodes, EdgeArray< edge > &eCopy)
Initializes the graph copy for the nodes in a component.
void initByActiveNodes (const List< node > &nodes, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy)
Initializes the graph copy for the nodes in nodes.
GraphCopyoperator= (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.
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.
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 () const
Returns a randomly chosen node.
edge chooseEdge () const
Returns a randomly chosen edge.
template<class NODELIST >
void allNodes (NODELIST &nodes) const
Returns a list with all nodes of the graph.
template<class EDGELIST >
void allEdges (EDGELIST &edges) const
Returns a list with all edges of the graph.
template<class EDGELIST >
void adjEdges (node v, EDGELIST &edges) const
Returns a list with all edges adjacent to node v.
Returns a list with all entries in the adjacency list of node v.
template<class EDGELIST >
void inEdges (node v, EDGELIST &edges) const
Returns a list with all incoming edges of node v.
template<class EDGELIST >
void outEdges (node v, EDGELIST &edges) const
Returns a list with all outgoing edges of node v.
node newNode (int index)
Creates a new node with predefined index and returns it.
edge newEdge (node v, node w, int index)
Creates a new edge (v,w) with predefined index and returns it.
Creates a new edge at predefined positions in the adjacency lists.
void delNode (node v)
Removes node v and all incident edges from the graph.
void delEdge (edge e)
Removes edge e from the graph.
void clear ()
Removes all nodes and all edges from the graph.
void hideEdge (edge e)
Hides the edge e.
void restoreEdge (edge e)
Restores a hidden edge e.
void restoreAllEdges ()
Restores all hidden edges.
void unsplit (node u)
Undoes a split operation.
Splits a node while preserving the order of adjacency entries.
node contract (edge e)
Contracts edge e while preserving the order of adjacency entries.
Moves edge e to a different adjacency list.
void moveTarget (edge e, node w)
Moves the target node of edge e to node w.
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.
Moves the source node of edge e to a specific position in an adjacency list.
edge searchEdge (node v, node w) const
Searches and returns an edge connecting nodes v and 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 collaps (NODELIST &nodes)
Collapses all nodes in the list nodes to the first node in the list.
void sort (node v, const ADJ_ENTRY_LIST &newOrder)
Sorts the adjacency list of node v according to newOrder.
Reverses the adjacency list of v.
Exchanges two entries in an adjacency list.
Reads a graph in GML format from file fileName.
Reads a graph in GML format from input stream is.
void writeGML (const char *fileName) const
Writes the graph in GML format to file fileName.
void writeGML (ostream &os) const
Writes the graph in GML format to output stream os.
Reads a graph in LEDA format from file fileName.
Read a graph in LEDA format from input stream is.
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< 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
void unregisterStructure (ListIterator< GraphObserver * > it) const
Unregisters a graph observer.
void resetEdgeIdCount (int maxId)
Resets the edge id count to maxId.
Graphoperator= (const Graph &G)
Assignment operator.

Protected Member Functions

edgeType assClassPattern ()
edgeType associationPattern ()
edgeType brotherPattern ()
edgeType cliquePattern ()
edgeType expansionPattern ()
edgeType generalizationPattern ()
edgeType halfBrotherPattern ()
void setCopyType (edge eCopy, edge eOrig)

Protected Attributes

int m_currentCC
The index of the current component.
EdgeArray< edgem_eAuxCopy
EdgeArray< edgeTypem_edgeTypes
EdgeArray< EdgeTypem_eType
NodeArray< nodem_expandedNode
For all expansion nodes, save expanded node.
EdgeArray< int > m_expansionEdge
Array< List< node > > m_nodesInCC
The list of original nodes in each component.
NodeArray< nodeTypem_nodeTypes
Node types for extended semantic information.
int m_numCC
The number of components in the original graph.
EdgeArray< edgeTypem_oriEdgeTypes
const GraphAttributesm_pGraphAttributes
Pointer to graph attributes of original graph.
NodeArray< NodeTypem_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< edgem_eOrig
The corresponding edge in the original graph.
const Graphm_pGraph
The original graph.
NodeArray< nodem_vCopy
The corresponding node in the graph copy.
NodeArray< nodem_vOrig
The corresponding node in the original graph.

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 74 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 ( )
inlinevirtual

Definition at line 100 of file PlanRep.h.

Member Function Documentation

 edgeType ogdf::PlanRep::assClassPattern ( )
inlineprotected

Definition at line 721 of file PlanRep.h.

 edgeType ogdf::PlanRep::associationPattern ( )
inlineprotected

Definition at line 719 of file PlanRep.h.

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

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

 edgeType ogdf::PlanRep::brotherPattern ( )
inlineprotected

Definition at line 722 of file PlanRep.h.

 edgeType ogdf::PlanRep::cliquePattern ( )
inlineprotected

Definition at line 724 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 121 of file PlanRep.h.

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

Definition at line 454 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 300 of file PlanRep.h.

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

Definition at line 456 of file PlanRep.h.

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

Definition at line 471 of file PlanRep.h.

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

Definition at line 474 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 309 of file PlanRep.h.

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

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

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

inline

Definition at line 167 of file PlanRep.h.

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

Definition at line 586 of file PlanRep.h.

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

Reimplemented in ogdf::ClusterPlanRep.

 edgeType ogdf::PlanRep::expansionPattern ( )
inlineprotected

Definition at line 720 of file PlanRep.h.

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

Definition at line 507 of file PlanRep.h.

 edgeType ogdf::PlanRep::generalizationPattern ( )
inlineprotected

Definition at line 718 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 551 of file PlanRep.h.

 edgeType ogdf::PlanRep::halfBrotherPattern ( )
inlineprotected

Definition at line 723 of file PlanRep.h.

 const NodeArray& ogdf::PlanRep::heightOrig ( ) const
inline

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

Definition at line 536 of file PlanRep.h.

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

Returns the height of original node v.

Definition at line 541 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::PlanRepUML, and ogdf::ClusterPlanRep.

 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.

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

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

Returns true iff edge e is a clique boundary.

Definition at line 409 of file PlanRep.h.

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

Returns true if edge e is classified as brother.

Definition at line 442 of file PlanRep.h.

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

Definition at line 197 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 260 of file PlanRep.h.

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

Definition at line 510 of file PlanRep.h.

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

Returns true iff edge e is classified as dependency.

Definition at line 367 of file PlanRep.h.

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

Returns true iff edge e is classified as expansion edge.

Definition at line 402 of file PlanRep.h.

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

Definition at line 503 of file PlanRep.h.

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

Returns true iff edge e is classified as generalization.

Definition at line 353 of file PlanRep.h.

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

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

Definition at line 447 of file PlanRep.h.

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

Definition at line 483 of file PlanRep.h.

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

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

Definition at line 232 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.

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

 const List& ogdf::PlanRep::nodesInCC ( ) const
inline

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

Definition at line 137 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 242 of file PlanRep.h.

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

Returns the number of connected components in the original graph.

Definition at line 114 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 291 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 650 of file PlanRep.h.

 void ogdf::PlanRep::removePseudoCrossings ( )
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 416 of file PlanRep.h.

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

Classifies edge e as association (primary type).

Definition at line 381 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 432 of file PlanRep.h.

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

Definition at line 194 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 251 of file PlanRep.h.

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

Classifies edge e as dependency (primary type).

Definition at line 373 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 319 of file PlanRep.h.

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

Definition at line 588 of file PlanRep.h.

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

Classifies edge e as expansion edge (secondary type).

Definition at line 394 of file PlanRep.h.

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

Definition at line 499 of file PlanRep.h.

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

Classifies edge e as generalization (primary type).

Definition at line 359 of file PlanRep.h.

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

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

Definition at line 437 of file PlanRep.h.

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

Definition at line 460 of file PlanRep.h.

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

Definition at line 465 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 332 of file PlanRep.h.

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

Definition at line 477 of file PlanRep.h.

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

Splits edge e.

Reimplemented from ogdf::GraphCopy.

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

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

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

Returns the type of original edge e.

Definition at line 546 of file PlanRep.h.

 const NodeArray& ogdf::PlanRep::widthOrig ( ) const
inline

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

Definition at line 526 of file PlanRep.h.

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

Returns the width of original node v.

Definition at line 531 of file PlanRep.h.

Member Data Documentation

protected

Definition at line 744 of file PlanRep.h.

 int ogdf::PlanRep::m_currentCC
protected

The index of the current component.

Definition at line 703 of file PlanRep.h.

 EdgeArray ogdf::PlanRep::m_eAuxCopy
protected

Definition at line 763 of file PlanRep.h.

 EdgeArray ogdf::PlanRep::m_edgeTypes
protected

Definition at line 756 of file PlanRep.h.

 EdgeArray ogdf::PlanRep::m_eType
protected

Definition at line 748 of file PlanRep.h.

protected

Definition at line 740 of file PlanRep.h.

 NodeArray ogdf::PlanRep::m_expandedNode
protected

For all expansion nodes, save expanded node.

Definition at line 739 of file PlanRep.h.

 EdgeArray ogdf::PlanRep::m_expansionEdge
protected

Definition at line 747 of file PlanRep.h.

 Array > ogdf::PlanRep::m_nodesInCC
protected

The list of original nodes in each component.

Definition at line 706 of file PlanRep.h.

 NodeArray ogdf::PlanRep::m_nodeTypes
protected

Node types for extended semantic information.

Definition at line 737 of file PlanRep.h.

 int ogdf::PlanRep::m_numCC
protected

The number of components in the original graph.

Definition at line 704 of file PlanRep.h.

 EdgeArray ogdf::PlanRep::m_oriEdgeTypes
protected

Definition at line 761 of file PlanRep.h.

 const GraphAttributes* ogdf::PlanRep::m_pGraphAttributes
protected

Pointer to graph attributes of original graph.

Definition at line 708 of file PlanRep.h.

 NodeArray ogdf::PlanRep::m_vType
protected

Simple node types.

Definition at line 735 of file PlanRep.h.

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