|
| | DualGraphBase (Embedding &CE) |
| | Constructor; creates dual graph and its combinatorial embedding.
|
| |
| | ~DualGraphBase () |
| | Destructor.
|
| |
| Embedding & | getPrimalEmbedding () const |
| | Returns a reference to the combinatorial embedding of the primal graph.
|
| |
| const Graph & | getPrimalGraph () const |
| | Returns a reference to the primal graph.
|
| |
|
| const node & | primalNode (face f) const |
| | Returns the node in the primal graph corresponding to f.
|
| |
| const edge & | primalEdge (edge e) const |
| | Returns the edge in the primal graph corresponding to e.
|
| |
| const face & | primalFace (node v) const |
| | Returns the face in the embedding of the primal graph corresponding to v.
|
| |
| const node & | dualNode (face f) const |
| | Returns the node in the dual graph corresponding to f.
|
| |
| const edge & | dualEdge (edge e) const |
| | Returns the edge in the dual graph corresponding to e.
|
| |
| const face & | dualFace (node v) const |
| | Returns the face in the embedding of the dual graph corresponding to v.
|
| |
| | CombinatorialEmbedding (Graph &G) |
| | Creates a combinatorial embedding of graph G.
|
| |
| const Graph & | getGraph () const |
| | Returns the associated graph.
|
| |
| Graph & | getGraph () |
| |
| | operator const Graph & () const |
| |
| | operator Graph & () |
| |
| void | init (Graph &G) |
| | Initializes the embedding for graph G.
|
| |
| void | clear () |
| | Removes all nodes, edges, and faces from the graph and the embedding.
|
| |
| edge | split (edge e) |
| | Splits edge e=(v,w) into e=(v,u) and e'=(u,w) creating a new node u.
|
| |
| void | unsplit (edge eIn, edge eOut) |
| | 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.
|
| |
| edge | splitFace (adjEntry adjSrc, adjEntry adjTgt, bool sourceAfter=false) |
| | Splits a face by inserting a new edge.
|
| |
| edge | addEdgeToIsolatedNode (node v, adjEntry adjTgt) |
| | Inserts a new edge similarly to splitFace without having to call computeFaces again.
|
| |
| edge | addEdgeToIsolatedNode (adjEntry adjSrc, node v) |
| | Inserts a new edge similarly to splitFace without having to call computeFaces again.
|
| |
| face | joinFaces (edge e) |
| | Removes edge e and joins the two faces adjacent to e.
|
| |
| void | reverseEdge (edge e) |
| | Reverses edges e and updates embedding.
|
| |
| void | moveBridge (adjEntry adjBridge, adjEntry adjBefore) |
| | Moves a bridge in the graph.
|
| |
| void | removeDeg1 (node v) |
| | Removes degree-1 node v.
|
| |
| void | updateMerger (edge e, face fRight, face fLeft) |
| | Update face information after inserting a merger in a copy graph.
|
| |
| | ConstCombinatorialEmbedding (const Graph &G) |
| | Creates a combinatorial embedding of graph G.
|
| |
| | ConstCombinatorialEmbedding (const ConstCombinatorialEmbedding &C) |
| | Copy constructor.
|
| |
| ConstCombinatorialEmbedding & | operator= (const ConstCombinatorialEmbedding &C) |
| | Assignment operator.
|
| |
| bool | valid () const |
| | Returns whether the embedding is associated with a graph.
|
| |
| const Graph & | getGraph () const |
| | Returns the associated graph of the combinatorial embedding.
|
| |
| | operator const Graph & () const |
| | Returns associated graph.
|
| |
| face | firstFace () const |
| | Returns the first face in the list of all faces.
|
| |
| face | lastFace () const |
| | Returns the last face in the list of all faces.
|
| |
| int | numberOfFaces () const |
| | Returns the number of faces.
|
| |
| face | rightFace (adjEntry adj) const |
| | Returns the face to the right of adj, i.e., the face containing adj.
|
| |
| face | leftFace (adjEntry adj) const |
| | Returns the face to the left of adj, i.e., the face containing the twin of adj.
|
| |
| int | maxFaceIndex () const |
| | Returns the largest used face index.
|
| |
| int | faceArrayTableSize () const |
| | Returns the table size of face arrays associated with this embedding.
|
| |
| face | chooseFace (std::function< bool(face)> includeFace=[](face) { return true;}, bool isFastTest=true) const |
| | Returns a random face.
|
| |
| face | maximalFace () const |
| | Returns a face of maximal size.
|
| |
| face | externalFace () const |
| | Returns the external face.
|
| |
| void | setExternalFace (face f) |
| | Sets the external face to f.
|
| |
| bool | isBridge (edge e) const |
| |
| void | init (const Graph &G) |
| | Initializes the embedding for graph G.
|
| |
| void | init () |
| |
| void | computeFaces () |
| | Computes the list of faces.
|
| |
| ListIterator< FaceArrayBase * > | registerArray (FaceArrayBase *pFaceArray) const |
| | Registers the face array pFaceArray.
|
| |
| void | unregisterArray (ListIterator< FaceArrayBase * > it) const |
| | Unregisters the face array identified by it.
|
| |
| void | moveRegisterArray (ListIterator< FaceArrayBase * > it, FaceArrayBase *pFaceArray) const |
| | Move the registration it of a node array to pFaceArray (used with move semantics for face arrays).
|
| |
| adjEntry | findCommonFace (const node v, const node w, bool left=true) const |
| | Identifies a common face of two nodes and returns the respective adjacency entry.
|
| |
| adjEntry | findCommonFace (const node v, const node w, adjEntry &adjW, bool left=true) const |
| | Identifies a common face of two nodes and returns the respective adjacency entry.
|
| |
|
| Embedding & | m_primalEmbedding |
| | The embedding of the primal graph.
|
| |
| FaceArray< node > | m_primalNode |
| | The corresponding node in the primal graph.
|
| |
| NodeArray< face > | m_primalFace |
| | The corresponding facee in the embedding of the primal graph.
|
| |
| EdgeArray< edge > | m_primalEdge |
| | The corresponding edge in the primal graph.
|
| |
| FaceArray< node > | m_dualNode |
| | The corresponding node in the dual graph.
|
| |
| NodeArray< face > | m_dualFace |
| | The corresponding face in embedding of the dual graph.
|
| |
| EdgeArray< edge > | m_dualEdge |
| | The corresponding edge in the dual graph.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| edge | splitPrimal (edge e) |
| | Splits edge e=(v,w) into e=(v,u) and e'=(u,w) creating a new node u.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| void | unsplitPrimal (edge eIn, edge eOut) |
| | Undoes a split operation.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| node | splitNodePrimal (adjEntry adjStartLeft, adjEntry adjStartRight) |
| | Splits a node while preserving the order of adjacency entries.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| node | contractPrimal (edge e, bool keepSelfLoops=false) |
| | Contracts edge e while preserving the order of adjacency entries.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| edge | splitFacePrimal (adjEntry adjSrc, adjEntry adjTgt, bool sourceAfter=false) |
| | Splits a face by inserting a new edge.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| edge | addEdgeToIsolatedNodePrimal (node v, adjEntry adjTgt) |
| | Inserts a new edge similarly to splitFace without having to call computeFaces again.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| edge | addEdgeToIsolatedNodePrimal (adjEntry adjSrc, node v) |
| | Inserts a new edge similarly to splitFace without having to call computeFaces again.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| face | joinFacesPrimal (edge e) |
| | Removes edge e and joins the two faces adjacent to e.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| void | removeDeg1Primal (node v) |
| | Removes degree-1 node v.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| void | reverseEdgePrimal (edge e) |
| | Reverses edges e and updates embedding.
|
| |
| template<bool isConstSFINAE = isConst, typename std::enable_if<!isConstSFINAE, int >::type = 0> |
| edge | addEdgeToIsolatedNodePrimal (adjEntry adj, node v, bool adjSrc) |
| | Inserts a new edge similarly to splitFace without having to call computeFaces again.
|
| |
| adjEntry | dualAdj (adjEntry primalAdj, bool reverse=false) |
| | Returns the corresponding adjEntry of the dual edge of primalAdj (or the opposite adjEntry of the dual edge if reverse is set).
|
| |
template<
bool isConst>
class ogdf::DualGraphBase< isConst >
A dual graph including its combinatorial embedding of an embedded graph.
Dual edges are rotated counter-clockwise compared to the primal ones.
Definition at line 56 of file DualGraph.h.
Inheritance diagram for ogdf::DualGraphBase< isConst >:
