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. | |
| GraphCopy () | |
| Default constructor (does nothing!). | |
| GraphCopy (const GraphCopy &GC) | |
| Copy constructor. | |
| virtual | ~GraphCopy () |
Mapping between original graph and copy | |
| 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. | |
| 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. | |
Creation and deletion of nodes and edges | |
| 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. | |
| virtual edge | split (edge e) |
| Splits edge e. | |
| 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. | |
| edge | newEdge (edge eOrig, adjEntry adjSrc, node w) |
| Creates a new edge with original edge eOrig at predefined positions in the adjacency lists. | |
| edge | newEdge (edge eOrig, node v, adjEntry adjTgt) |
| 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. | |
| edge | newEdge (adjEntry adjSrc, adjEntry adjTgt) |
| 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 | setEdge (edge eOrig, edge eCopy) |
| sets eOrig to be the corresponding original edge of eCopy and vice versa | |
| 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) |
| void | removeEdgePath (edge eOrig) |
| Removes the complete edge path for edge eOrig. | |
| edge | insertCrossing (edge &crossingEdge, edge crossedEdge, bool topDown) |
| Inserts crossings between two copy edges. | |
Combinatorial Embeddings | |
| 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 | removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSetPure &newFaces) |
Miscellaneous | |
| 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. | |
Operators | |
| 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 () 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. | |
| template<class ADJLIST > | |
| void | adjEntries (node v, ADJLIST &entries) const |
| 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. | |
| edge | newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::after) |
| 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. | |
| node | splitNode (adjEntry adjStartLeft, adjEntry adjStartRight) |
| Splits a node while preserving the order of adjacency entries. | |
| node | contract (edge e) |
| 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) 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. | |
| 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. | |
| bool | readGML (const char *fileName) |
| Reads a graph in GML format from file fileName. | |
| bool | readGML (istream &is) |
| 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. | |
| bool | readLEDAGraph (const char *fileName) |
| Reads a graph in LEDA format from file fileName. | |
| bool | readLEDAGraph (istream &is) |
| 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< 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. | |
| void | resetEdgeIdCount (int maxId) |
| Resets the edge id count to maxId. | |
| Graph & | operator= (const Graph &G) |
| Assignment operator. | |
Protected Attributes | |
| 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. | |
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. | |
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 | 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. | |
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.
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:
Definition at line 226 of file GraphCopy.h.
| 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.
|
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.
|
inlinevirtual |
Definition at line 256 of file GraphCopy.h.
Returns the list of edges coresponding to edge e.
| e | is an edge in the original graph. |
Definition at line 295 of file GraphCopy.h.
| bool ogdf::GraphCopy::consistencyCheck | ( | ) | const |
Checks the consistency of the data structure (for debugging only).
Reimplemented from ogdf::Graph.
Returns the node in the graph copy corresponding to v.
| v | is a node in the original graph. |
Definition at line 288 of file GraphCopy.h.
Returns the first edge in the list of edges coresponding to edge e.
| e | is an edge in the original graph. |
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:
| G | is the graph of which this graph copy shall be a copy. |
| void ogdf::GraphCopy::delCopy | ( | node | v | ) |
Removes node v and all its adjacent edges cleaning-up their corresponding lists of original edges.
| v | is a node in the graph copy. |
| void ogdf::GraphCopy::delCopy | ( | edge | e | ) |
Removes edge e and clears the list of edges corresponding to e's original edge.
| e | is an edge in 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.
| nodes | is the list of nodes in the original graph for which copies are created in the graph copy. |
| activeNodes | must be true for every node in nodes, false otherwise. |
| eCopy | is assigned the copy of each original edge. |
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().
| nodes | is the list of nodes in the original graph for which copies are created in the graph copy. |
| eCopy | is assigned the copy of each original edge. |
|
private |
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).
| 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 in ogdf::PlanRep.
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\).
| 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 in ogdf::PlanRep.
| void ogdf::GraphCopy::insertEdgePath | ( | node | srcOrig, |
| node | tgtOrig, | ||
| const SList< adjEntry > & | crossedEdges | ||
| ) |
| 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).
| 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 in ogdf::PlanRep, and ogdf::ClusterPlanRep.
|
inline |
Returns true iff v has no corresponding node in the original graph.
| v | is a node in the graph copy. |
Definition at line 310 of file GraphCopy.h.
|
inline |
Returns true iff e has no corresponding edge in the original graph.
| e | is an edge in the graph copy. |
Definition at line 316 of file GraphCopy.h.
|
inline |
Returns true iff edge e has been reversed.
| e | is an edge in the original graph. |
Definition at line 322 of file GraphCopy.h.
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).
| eOrig | is the original edge. |
| adjSrc | is the adjacency entry after which the new edge is inserted in the adjacency list of v. |
| w | is the source node of the new edge; the edge is added at the end of the adjacency list of w. |
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).
| eOrig | is the original edge. |
| v | is the source node of the new edge; the edge is added at the end of the adjacency list of v. |
| adjTgt | is the adjacency entry after which the new edge is inserted in the adjacency list of w. |
Creates a new edge (v,w) and returns it.
| v | is the source node of the newly created edge. |
| w | is the target node of the newly created edge. |
Reimplemented from ogdf::Graph.
Definition at line 412 of file GraphCopy.h.
Definition at line 413 of file GraphCopy.h.
Creates a new edge at predefined positions in the adjacency lists.
Let w be the node whose adjacency list contains adjTgt. Then, the created edge is (v,w).
| v | is the source node of the new edge; the edge is added at the end of the adjacency list of v. |
| adjTgt | is the adjacency entry after which the new edge is inserted in the adjacency list of w. |
Reimplemented from ogdf::Graph.
Definition at line 414 of file GraphCopy.h.
Creates a new edge at predefined positions in the adjacency lists.
Let v be the node whose adjacency list contains adjSrc. Then, the created edge is (v,w).
| adjSrc | is the adjacency entry after which the new edge is inserted in the adjacency list of v. |
| w | is the source node of the new edge; the edge is added at the end of the adjacency list of w. |
Reimplemented from ogdf::Graph.
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.
| v | is a node in the graph copy. |
| adj | is an adjacency entry in the graph copy. |
| eOrig | is an edge in the original graph. |
| E | is an embedding of the graph copy. |
|
inline |
Creates a new node in the graph copy.
Reimplemented from ogdf::Graph.
Definition at line 333 of file GraphCopy.h.
Creates a new node in the graph copy with original node vOrig.
Definition at line 342 of file GraphCopy.h.
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.
|
inline |
Returns a reference to the original graph.
Definition at line 265 of file GraphCopy.h.
Returns the node in the original graph corresponding to v.
| v | is a node in the graph copy. |
Definition at line 273 of file GraphCopy.h.
Returns the edge in the original graph corresponding to e.
| e | is an edge in the graph copy. |
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.
| 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 in ogdf::PlanRep.
sets eOrig to be the corresponding original edge of eCopy and vice versa
| eOrig | is the original edge |
| eCopy | is the edge copy |
| void ogdf::GraphCopy::setOriginalEmbedding | ( | ) |
Sets the embedding of the graph copy to the embedding of the original graph.
Splits edge e.
| e | is an edge in the graph copy. |
Reimplemented from ogdf::Graph.
Reimplemented in ogdf::PlanRep, ogdf::PlanRepUML, ogdf::PlanRepInc, and ogdf::ClusterPlanRep.
Undoes a previous split operation. The two edges eIn and eOut are merged to a single edge eIn.
| eIn | is an edge (*,u) in the graph copy. |
| eOut | is an edge (u,*) in the graph copy. |
Reimplemented from ogdf::Graph.
The corresponding list of edges in the graph copy.
Definition at line 235 of file GraphCopy.h.
|
protected |
The position of copy edge in the list.
Definition at line 232 of file GraphCopy.h.
The corresponding edge in the original graph.
Definition at line 231 of file GraphCopy.h.
|
protected |
The original graph.
Definition at line 229 of file GraphCopy.h.
The corresponding node in the graph copy.
Definition at line 234 of file GraphCopy.h.
The corresponding node in the original graph.
Definition at line 230 of file GraphCopy.h.