Open
Graph Drawing
Framework

 v.2015.05
 

ogdf::GraphCopy Class Reference

Copies of graphs supporting edge splitting. More...

#include <ogdf/basic/GraphCopy.h>

+ Inheritance diagram for ogdf::GraphCopy:

Public Member Functions

 GraphCopy (const Graph &G)
 Creates a graph copy of G. More...
 
 GraphCopy ()
 Default constructor (does nothing!). More...
 
 GraphCopy (const GraphCopy &GC)
 Copy constructor. More...
 
virtual ~GraphCopy ()
 
Mapping between original graph and copy
const Graphoriginal () const
 Returns a reference to the original graph. More...
 
node original (node v) const
 Returns the node in the original graph corresponding to v. More...
 
edge original (edge e) const
 Returns the edge in the original graph corresponding to e. More...
 
node copy (node v) const
 Returns the node in the graph copy corresponding to v. More...
 
const List< edge > & chain (edge e) const
 Returns the list of edges coresponding to edge e. More...
 
edge copy (edge e) const
 Returns the first edge in the list of edges coresponding to edge e. More...
 
bool isDummy (node v) const
 Returns true iff v has no corresponding node in the original graph. More...
 
bool isDummy (edge e) const
 Returns true iff e has no corresponding edge in the original graph. More...
 
bool isReversed (edge e) const
 Returns true iff edge e has been reversed. More...
 
Creation and deletion of nodes and edges
node newNode ()
 Creates a new node in the graph copy. More...
 
node newNode (node vOrig)
 Creates a new node in the graph copy with original node vOrig. More...
 
virtual void delNode (node v)
 Removes node v and all its adjacent edges cleaning-up their corresponding lists of original edges. More...
 
virtual void delEdge (edge e)
 Removes edge e and clears the list of edges corresponding to e's original edge. More...
 
virtual edge split (edge e)
 Splits edge e. More...
 
void unsplit (edge eIn, edge eOut)
 Undoes a previous split operation. The two edges eIn and eOut are merged to a single edge eIn. More...
 
edge newEdge (edge eOrig)
 Creates a new edge (v,w) with original edge eOrig. More...
 
edge newEdge (edge eOrig, adjEntry adjSrc, node w)
 Creates a new edge with original edge eOrig at predefined positions in the adjacency lists. More...
 
edge newEdge (edge eOrig, node v, adjEntry adjTgt)
 Creates a new edge with original edge eOrig at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, node w)
 
edge newEdge (adjEntry adjSrc, adjEntry adjTgt)
 
edge newEdge (node v, adjEntry adjTgt)
 
edge newEdge (adjEntry adjSrc, node w)
 
void setEdge (edge eOrig, edge eCopy)
 sets eOrig to be the corresponding original edge of eCopy and vice versa More...
 
bool embed ()
 Embeds the graph copy. More...
 
void removePseudoCrossings ()
 Removes all crossing nodes which are actually only two "touching" edges. More...
 
void insertEdgePath (edge eOrig, const SList< adjEntry > &crossedEdges)
 Re-inserts edge eOrig by "crossing" the edges in crossedEdges. More...
 
void insertEdgePath (node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)
 Special version (for FixedEmbeddingUpwardEdgeInserter only). More...
 
void removeEdgePath (edge eOrig)
 Removes the complete edge path for edge eOrig. More...
 
edge insertCrossing (edge &crossingEdge, edge crossedEdge, bool topDown)
 Inserts crossings between two copy edges. More...
 
Combinatorial Embeddings
edge newEdge (node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E)
 Creates a new edge with original edge eOrig in an embedding E. More...
 
void setOriginalEmbedding ()
 Sets the embedding of the graph copy to the embedding of the original graph. More...
 
void insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
 Re-inserts edge eOrig by "crossing" the edges in crossedEdges in embedding E. More...
 
void removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSetPure &newFaces)
 Removes the complete edge path for edge eOrig while preserving the embedding. More...
 
Miscellaneous
bool consistencyCheck () const
 Checks the consistency of the data structure (for debugging only). More...
 
void createEmpty (const Graph &G)
 Associates the graph copy with G, but does not create any nodes or edges. More...
 
void initByCC (const CCsInfo &info, int cc, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in component cc. More...
 
void initByNodes (const List< node > &nodes, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in a component. More...
 
void initByActiveNodes (const List< node > &nodes, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in nodes. More...
 
Operators
GraphCopyoperator= (const GraphCopy &GC)
 Assignment operator. More...
 
- Public Member Functions inherited from ogdf::Graph
 Graph ()
 Constructs an empty graph. More...
 
 Graph (const Graph &G)
 Constructs a graph that is a copy of G. More...
 
virtual ~Graph ()
 Destructor. More...
 
bool empty () const
 Returns true iff the graph is empty, i.e., contains no nodes. More...
 
int numberOfNodes () const
 Returns the number of nodes in the graph. More...
 
int numberOfEdges () const
 Returns the number of edges in the graph. More...
 
int maxNodeIndex () const
 Returns the largest used node index. More...
 
int maxEdgeIndex () const
 Returns the largest used edge index. More...
 
int maxAdjEntryIndex () const
 Returns the largest used adjEntry index. More...
 
int nodeArrayTableSize () const
 Returns the table size of node arrays associated with this graph. More...
 
int edgeArrayTableSize () const
 Returns the table size of edge arrays associated with this graph. More...
 
int adjEntryArrayTableSize () const
 Returns the table size of adjEntry arrays associated with this graph. More...
 
node firstNode () const
 Returns the first node in the list of all nodes. More...
 
node lastNode () const
 Returns the last node in the list of all nodes. More...
 
edge firstEdge () const
 Returns the first edge in the list of all edges. More...
 
edge lastEdge () const
 Returns the last edge in the list of all edges. More...
 
node chooseNode () const
 Returns a randomly chosen node. More...
 
edge chooseEdge () const
 Returns a randomly chosen edge. More...
 
template<class NODELIST >
void allNodes (NODELIST &nodes) const
 Returns a list with all nodes of the graph. More...
 
template<class EDGELIST >
void allEdges (EDGELIST &edges) const
 Returns a list with all edges of the graph. More...
 
template<class EDGELIST >
void adjEdges (node v, EDGELIST &edges) const
 Returns a list with all edges adjacent to node v. More...
 
template<class ADJLIST >
void adjEntries (node v, ADJLIST &entries) const
 Returns a list with all entries in the adjacency list of node v. More...
 
template<class EDGELIST >
void inEdges (node v, EDGELIST &edges) const
 Returns a list with all incoming edges of node v. More...
 
template<class EDGELIST >
void outEdges (node v, EDGELIST &edges) const
 Returns a list with all outgoing edges of node v. More...
 
node newNode ()
 Creates a new node and returns it. More...
 
node newNode (int index)
 Creates a new node with predefined index and returns it. More...
 
edge newEdge (node v, node w)
 Creates a new edge (v,w) and returns it. More...
 
edge newEdge (node v, node w, int index)
 Creates a new edge (v,w) with predefined index and returns it. More...
 
edge newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::after)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, adjEntry adjTgt)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (adjEntry adjSrc, node w)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
void clear ()
 Removes all nodes and all edges from the graph. More...
 
void hideEdge (edge e)
 Hides the edge e. More...
 
void restoreEdge (edge e)
 Restores a hidden edge e. More...
 
void restoreAllEdges ()
 Restores all hidden edges. More...
 
void unsplit (node u)
 Undoes a split operation. More...
 
node splitNode (adjEntry adjStartLeft, adjEntry adjStartRight)
 Splits a node while preserving the order of adjacency entries. More...
 
node contract (edge e)
 Contracts edge e while preserving the order of adjacency entries. More...
 
void move (edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)
 Moves edge e to a different adjacency list. More...
 
void moveTarget (edge e, node w)
 Moves the target node of edge e to node w. More...
 
void moveTarget (edge e, adjEntry adjTgt, Direction dir)
 Moves the target node of edge e to a specific position in an adjacency list. More...
 
void moveSource (edge e, node w)
 Moves the source node of edge e to node w. More...
 
void moveSource (edge e, adjEntry adjSrc, Direction dir)
 Moves the source node of edge e to a specific position in an adjacency list. More...
 
edge searchEdge (node v, node w) const
 Searches and returns an edge connecting nodes v and w in time O(min(deg(v), deg(w))). More...
 
void reverseEdge (edge e)
 Reverses the edge e, i.e., exchanges source and target node. More...
 
void reverseAllEdges ()
 Reverses all edges in the graph. More...
 
template<class NODELIST >
void collaps (NODELIST &nodes)
 Collapses all nodes in the list nodes to the first node in the list. More...
 
template<class ADJ_ENTRY_LIST >
void sort (node v, const ADJ_ENTRY_LIST &newOrder)
 Sorts the adjacency list of node v according to newOrder. More...
 
void reverseAdjEdges (node v)
 Reverses the adjacency list of v. More...
 
void moveAdj (adjEntry adjMove, Direction dir, adjEntry adjPos)
 Moves adjacency entry adjMove before or after adjPos. More...
 
void moveAdjAfter (adjEntry adjMove, adjEntry adjAfter)
 Moves adjacency entry adjMove after adjAfter. More...
 
void moveAdjBefore (adjEntry adjMove, adjEntry adjBefore)
 Moves adjacency entry adjMove before adjBefore. More...
 
void reverseAdjEdges ()
 Reverses all adjacency lists. More...
 
void swapAdjEdges (adjEntry adj1, adjEntry adj2)
 Exchanges two entries in an adjacency list. More...
 
int genus () const
 Returns the genus of the graph's embedding. More...
 
bool representsCombEmbedding () const
 Returns true iff the graph represents a combinatorial embedding. More...
 
bool consistencyCheck () const
 Checks the consistency of the data structure. More...
 
ListIterator< NodeArrayBase * > registerArray (NodeArrayBase *pNodeArray) const
 Registers a node array. More...
 
ListIterator< EdgeArrayBase * > registerArray (EdgeArrayBase *pEdgeArray) const
 Registers an edge array. More...
 
ListIterator< AdjEntryArrayBase * > registerArray (AdjEntryArrayBase *pAdjArray) const
 Registers an adjEntry array. More...
 
ListIterator< GraphObserver * > registerStructure (GraphObserver *pStructure) const
 Registers a graph observer (e.g. a ClusterGraph). More...
 
void unregisterArray (ListIterator< NodeArrayBase * > it) const
 Unregisters a node array. More...
 
void unregisterArray (ListIterator< EdgeArrayBase * > it) const
 Unregisters an edge array. More...
 
void unregisterArray (ListIterator< AdjEntryArrayBase * > it) const
 unregisters an adjEntry array. More...
 
void unregisterStructure (ListIterator< GraphObserver * > it) const
 Unregisters a graph observer. More...
 
void resetEdgeIdCount (int maxId)
 Resets the edge id count to maxId. More...
 
Graphoperator= (const Graph &G)
 Assignment operator. More...
 

Protected Member Functions

void removeUnnecessaryCrossing (adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)
 
- 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 > &nodes, 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. More...
 
void constructInitByNodes (const Graph &G, const List< node > &nodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 Constructs a copy of the subgraph of G induced by nodes. More...
 

Protected Attributes

EdgeArray< List< edge > > m_eCopy
 The corresponding list of edges in the graph copy. More...
 
EdgeArray< ListIterator< edge > > m_eIterator
 The position of copy edge in the list. More...
 
EdgeArray< edgem_eOrig
 The corresponding edge in the original graph. More...
 
const Graphm_pGraph
 The original graph. More...
 
NodeArray< nodem_vCopy
 The corresponding node in the graph copy. More...
 
NodeArray< nodem_vOrig
 The corresponding node in the original graph. More...
 

Private Member Functions

void initGC (const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy)
 

Additional Inherited Members

- Public Types inherited from ogdf::Graph
enum  EdgeType { association = 0, generalization = 1, dependency = 2 }
 The type of edges (only used in derived classes). More...
 
enum  NodeType { vertex, dummy, generalizationMerger, generalizationExpander, highDegreeExpander, lowDegreeExpander, associationClass }
 The type of nodes. More...
 
- Static Public Member Functions inherited from ogdf::Graph
static int nextPower2 (int start, int idCount)
 Returns the smallest power of 2 which is >= 2^start and > idCount. More...
 

Detailed Description

Copies of graphs supporting edge splitting.

The class GraphCopy represents a copy of a graph and maintains a mapping between the nodes and edges of the original graph to the copy and vice versa.

New nodes and edges can be added to the copy; the counterpart of those nodes and edges is 0 indicating that there is no counterpart. GraphCopy also support splitting of edges in such a way that both edges resulting from the split are mapped to the same original edge, and each edge of the original graph is mapped to a list of edges. Furthermore, it is allowed to reverse edges in the graph copy.

Do's and Dont's

Here is a short summary, what can be done with GraphCopy, and what should not be done. The following operations are safely supported:

The following operations are not supported and are thus dangerous:

  • Any modifications on the original graph, since the copy will not be notified.
  • Moving the source or target node of an edge in the copy to a different node.
  • Removing edges in the graph copy that belong to a path representing an original edge.
  • ... (better think first!)

Definition at line 226 of file GraphCopy.h.

Constructor & Destructor Documentation

ogdf::GraphCopy::GraphCopy ( const Graph G)

Creates a graph copy of G.

The constructor assures that the adjacency lists of nodes in the constructed copy are in the same order as the adjacency lists in G. This is in particular important when dealing with embedded graphs.

ogdf::GraphCopy::GraphCopy ( )
inline

Default constructor (does nothing!).

Definition at line 247 of file GraphCopy.h.

ogdf::GraphCopy::GraphCopy ( const GraphCopy GC)

Copy constructor.

Creates a graph copy that is a copy of GC and represents a graph copy of the original graph of GC.

virtual ogdf::GraphCopy::~GraphCopy ( )
inlinevirtual

Definition at line 256 of file GraphCopy.h.

Member Function Documentation

const List<edge>& ogdf::GraphCopy::chain ( edge  e) const
inline

Returns the list of edges coresponding to edge e.

Parameters
eis an edge in the original graph.
Returns
the corresponding list of edges in the graph copy.

Definition at line 295 of file GraphCopy.h.

bool ogdf::GraphCopy::consistencyCheck ( ) const

Checks the consistency of the data structure (for debugging only).

node ogdf::GraphCopy::copy ( node  v) const
inline

Returns the node in the graph copy corresponding to v.

Parameters
vis a node in the original graph.
Returns
the corresponding node in the graph copy.

Definition at line 288 of file GraphCopy.h.

edge ogdf::GraphCopy::copy ( edge  e) const
inline

Returns the first edge in the list of edges coresponding to edge e.

Parameters
eis an edge in the original graph.
Returns
the first edge in the corresponding list of edges in the graph copy or NULL if it does not exist.

Definition at line 304 of file GraphCopy.h.

void ogdf::GraphCopy::createEmpty ( const Graph G)

Associates the graph copy with G, but does not create any nodes or edges.

This method is used for a special creation of the graph copy. The graph copy needs to be constructed with the default constructor, gets associated with G using this method, and then is initialized using either initByNodes() or initByActiveNodes().

The following code snippet shows a typical application of this functionality:

GC.createEmpty(G);
// compute connected components of G
NodeArray<int> component(G);
int numCC = connectedComponents(G,component);
// intialize the array of lists of nodes contained in a CC
Array<List<node> > nodesInCC(numCC);
node v;
nodesInCC[component[v]].pushBack(v);
EdgeArray<edge> auxCopy(G);
Array<DPoint> boundingBox(numCC);
for(int i = 0; i < numCC; ++i) {
GC.initByNodes(nodesInCC[i],auxCopy);
...
}
Parameters
Gis the graph of which this graph copy shall be a copy.
virtual void ogdf::GraphCopy::delEdge ( edge  e)
virtual

Removes edge e and clears the list of edges corresponding to e's original edge.

Precondition
The list of edges corresponding to e's original edge contains only e.
Parameters
eis an edge in the graph copy.

Reimplemented from ogdf::Graph.

virtual void ogdf::GraphCopy::delNode ( node  v)
virtual

Removes node v and all its adjacent edges cleaning-up their corresponding lists of original edges.

Precondition
The corresponding lists oforiginal edges contain each only one edge.
Parameters
vis a node in the graph copy.

Reimplemented from ogdf::Graph.

bool ogdf::GraphCopy::embed ( )

Embeds the graph copy.

void ogdf::GraphCopy::initByActiveNodes ( const List< node > &  nodes,
const NodeArray< bool > &  activeNodes,
EdgeArray< edge > &  eCopy 
)

Initializes the graph copy for the nodes in nodes.

Creates copies of all nodes in nodes and edges between two nodes which are both contained in nodes. Any nodes and edges allocated before are destroyed.

See also
createEmpty()
Parameters
nodesis the list of nodes in the original graph for which copies are created in the graph copy.
activeNodesmust be true for every node in nodes, false otherwise.
eCopyis assigned the copy of each original edge.
void ogdf::GraphCopy::initByCC ( const CCsInfo info,
int  cc,
EdgeArray< edge > &  eCopy 
)

Initializes the graph copy for the nodes in component cc.

Parameters
infomust be a connected component info structure for the original graph.
ccis the number of the connected component.
eCopyis assigned a mapping from original to copy edges.
void ogdf::GraphCopy::initByNodes ( const List< node > &  nodes,
EdgeArray< edge > &  eCopy 
)

Initializes the graph copy for the nodes in a component.

Creates copies of all nodes in nodes and their incident edges. Any nodes and edges allocated before are removed.

The order of entries in the adjacency lists is preserved, i.e., if the original graph is embedded, its embedding induces the embedding of the created copy.

It is important that nodes is the complete list of nodes in a connected component. If you wish to initialize the graph copy for an arbitrary set of nodes, use the method initByActiveNodes().

See also
createEmpty() for an example.
Parameters
nodesis the list of nodes in the original graph for which copies are created in the graph copy.
eCopyis assigned the copy of each original edge.
void ogdf::GraphCopy::initGC ( const GraphCopy GC,
NodeArray< node > &  vCopy,
EdgeArray< edge > &  eCopy 
)
private
edge ogdf::GraphCopy::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
crossingEdgeis the edge that gets split.
crossedEdgeis the edge that is replaced by two new edges.
topDownis used as follows: If set to true, crossingEdge will cross crossedEdge from right to left, otherwise from left to right.
void ogdf::GraphCopy::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
eOrigis an edge in the original graph and becomes the original edge of all edges in the path \(v,u_1,\ldots,u_k,w\).
crossedEdgesare edges in the graph copy.
void ogdf::GraphCopy::insertEdgePath ( node  srcOrig,
node  tgtOrig,
const SList< adjEntry > &  crossedEdges 
)

Special version (for FixedEmbeddingUpwardEdgeInserter only).

void ogdf::GraphCopy::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).

insertEdgePathEmbedded.png
Parameters
eOrigis an edge in the original graph and becomes the original edge of all edges in the path \(v,u_1,\ldots,u_k,w\).
Eis an embedding of the graph copy.
crossedEdgesare a list of adjacency entries in the graph copy.
bool ogdf::GraphCopy::isDummy ( node  v) const
inline

Returns true iff v has no corresponding node in the original graph.

Parameters
vis a node in the graph copy.

Definition at line 310 of file GraphCopy.h.

bool ogdf::GraphCopy::isDummy ( edge  e) const
inline

Returns true iff e has no corresponding edge in the original graph.

Parameters
eis an edge in the graph copy.

Definition at line 316 of file GraphCopy.h.

bool ogdf::GraphCopy::isReversed ( edge  e) const
inline

Returns true iff edge e has been reversed.

Parameters
eis an edge in the original graph.

Definition at line 322 of file GraphCopy.h.

edge ogdf::GraphCopy::newEdge ( edge  eOrig)

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

edge ogdf::GraphCopy::newEdge ( edge  eOrig,
adjEntry  adjSrc,
node  w 
)

Creates a new edge with original edge eOrig at predefined positions in the adjacency lists.

Let v be the node whose adjacency list contains adjSrc. Then, the created edge is (v,w).

Parameters
eOrigis the original edge.
adjSrcis the adjacency entry after which the new edge is inserted in the adjacency list of v.
wis the source node of the new edge; the edge is added at the end of the adjacency list of w.
Returns
the created edge.
edge ogdf::GraphCopy::newEdge ( edge  eOrig,
node  v,
adjEntry  adjTgt 
)

Creates a new edge with original edge eOrig at predefined positions in the adjacency lists.

Let w be the node whose adjacency list contains adjTgt. Then, the created edge is (v,w).

Parameters
eOrigis the original edge.
vis the source node of the new edge; the edge is added at the end of the adjacency list of v.
adjTgtis the adjacency entry after which the new edge is inserted in the adjacency list of w.
Returns
the created edge.
edge ogdf::GraphCopy::newEdge ( node  v,
node  w 
)
inline

Definition at line 412 of file GraphCopy.h.

edge ogdf::GraphCopy::newEdge ( adjEntry  adjSrc,
adjEntry  adjTgt 
)
inline

Definition at line 413 of file GraphCopy.h.

edge ogdf::GraphCopy::newEdge ( node  v,
adjEntry  adjTgt 
)
inline

Definition at line 414 of file GraphCopy.h.

edge ogdf::GraphCopy::newEdge ( adjEntry  adjSrc,
node  w 
)
inline

Definition at line 415 of file GraphCopy.h.

edge ogdf::GraphCopy::newEdge ( node  v,
adjEntry  adj,
edge  eOrig,
CombinatorialEmbedding E 
)

Creates a new edge with original edge eOrig in an embedding E.

Let w be the node whose adjacency list contains adjTgt. The original edge eOrig must connect the original nodes of v and w. If eOrig = (original(v),original(w)), then the created edge is (v,w), otherwise it is (w,v). The new edge e must split a face in E, such that e comes after adj in the adjacency list of v and at the end of the adjacency list of v.

Parameters
vis a node in the graph copy.
adjis an adjacency entry in the graph copy.
eOrigis an edge in the original graph.
Eis an embedding of the graph copy.
Returns
the created edge.
node ogdf::GraphCopy::newNode ( )
inline

Creates a new node in the graph copy.

Definition at line 333 of file GraphCopy.h.

node ogdf::GraphCopy::newNode ( node  vOrig)
inline

Creates a new node in the graph copy with original node vOrig.

Warning
You have to make sure that the original node makes sense, in particular that vOrig is not the original node of another node in the copy.

Definition at line 342 of file GraphCopy.h.

GraphCopy& ogdf::GraphCopy::operator= ( const GraphCopy GC)

Assignment operator.

Creates a graph copy that is a copy of GC and represents a graph copy of the original graph of GC.

The constructor assures that the adjacency lists of nodes in the constructed graph are in the same order as the adjacency lists in G. This is in particular important when dealing with embedded graphs.

const Graph& ogdf::GraphCopy::original ( ) const
inline

Returns a reference to the original graph.

Definition at line 265 of file GraphCopy.h.

node ogdf::GraphCopy::original ( node  v) const
inline

Returns the node in the original graph corresponding to v.

Parameters
vis a node in the graph copy.
Returns
the corresponding node in the original graph, or 0 if no such node exists.

Definition at line 273 of file GraphCopy.h.

edge ogdf::GraphCopy::original ( edge  e) const
inline

Returns the edge in the original graph corresponding to e.

Parameters
eis an edge in the graph copy.
Returns
the corresponding edge in the original graph, or 0 if no such edge exists.

Definition at line 281 of file GraphCopy.h.

void ogdf::GraphCopy::removeEdgePath ( edge  eOrig)

Removes the complete edge path for edge eOrig.

@param eOrig is an edge in the original graph.

void ogdf::GraphCopy::removeEdgePathEmbedded ( CombinatorialEmbedding E,
edge  eOrig,
FaceSetPure newFaces 
)

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

Parameters
Eis an embedding of the graph copy.
eOrigis an edge in the original graph.
newFacesis assigned the set of new faces resulting from joining faces when removing edges.
void ogdf::GraphCopy::removePseudoCrossings ( )

Removes all crossing nodes which are actually only two "touching" edges.

void ogdf::GraphCopy::removeUnnecessaryCrossing ( adjEntry  adjA1,
adjEntry  adjA2,
adjEntry  adjB1,
adjEntry  adjB2 
)
protected
void ogdf::GraphCopy::setEdge ( edge  eOrig,
edge  eCopy 
)

sets eOrig to be the corresponding original edge of eCopy and vice versa

Parameters
eOrigis the original edge
eCopyis the edge copy
void ogdf::GraphCopy::setOriginalEmbedding ( )

Sets the embedding of the graph copy to the embedding of the original graph.

Precondition
The graph copy has not been changed after construction, i.e., no new nodes or edges have been added and no edges have been split.
virtual edge ogdf::GraphCopy::split ( edge  e)
virtual

Splits edge e.

Parameters
eis an edge in the graph copy.

Reimplemented from ogdf::Graph.

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

void ogdf::GraphCopy::unsplit ( edge  eIn,
edge  eOut 
)
virtual

Undoes a previous split operation. The two edges eIn and eOut are merged to a single edge eIn.

Precondition
The vertex u that was created by the previous split operation has exactly one incoming edge eIn and one outgoing edge eOut.
Parameters
eInis an edge (*,u) in the graph copy.
eOutis an edge (u,*) in the graph copy.

Reimplemented from ogdf::Graph.

Member Data Documentation

EdgeArray<List<edge> > ogdf::GraphCopy::m_eCopy
protected

The corresponding list of edges in the graph copy.

Definition at line 235 of file GraphCopy.h.

EdgeArray<ListIterator<edge> > ogdf::GraphCopy::m_eIterator
protected

The position of copy edge in the list.

Definition at line 232 of file GraphCopy.h.

EdgeArray<edge> ogdf::GraphCopy::m_eOrig
protected

The corresponding edge in the original graph.

Definition at line 231 of file GraphCopy.h.

const Graph* ogdf::GraphCopy::m_pGraph
protected

The original graph.

Definition at line 229 of file GraphCopy.h.

NodeArray<node> ogdf::GraphCopy::m_vCopy
protected

The corresponding node in the graph copy.

Definition at line 234 of file GraphCopy.h.

NodeArray<node> ogdf::GraphCopy::m_vOrig
protected

The corresponding node in the original graph.

Definition at line 230 of file GraphCopy.h.


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