Public Member Functions |
| | ExtendedNestingGraph (const ClusterGraph &CG) |
| int | aeLevel (node v) const |
| node | bottom (cluster cOrig) const |
| int | bottomRank (cluster c) const |
| const List< edge > & | chain (edge e) const |
| node | copy (node v) const |
| const ClusterGraphCopy & | getClusterGraph () const |
| const ClusterGraph & | getOriginalClusterGraph () const |
| bool | isLongEdgeDummy (node v) const |
| bool | isReversed (edge e) const |
| bool | isVirtual (cluster c) const |
| const ENGLayer & | layer (int i) const |
| const LHTreeNode * | layerHierarchyTree (int i) const |
| int | numberOfLayers () const |
| edge | origEdge (edge e) const |
| cluster | originalCluster (node v) const |
| node | origNode (node v) const |
| cluster | parent (node v) const |
| cluster | parent (cluster c) const |
| void | permute () |
| int | pos (node v) const |
| int | rank (node v) const |
| RCCrossings | reduceCrossings (int i, bool dirTopDown) |
| void | removeTopBottomEdges () |
| void | restorePos () |
| void | storeCurrentPos () |
| node | top (cluster cOrig) const |
| int | topRank (cluster c) const |
| NodeType | type (node v) const |
| bool | verticalSegment (edge e) const |
| | 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 () |
| | Creates a new node and returns it.
|
| node | newNode (int index) |
| | Creates a new node with predefined index and returns it.
|
| edge | newEdge (node v, node w) |
| | Creates a new edge (v,w) and returns it.
|
| edge | newEdge (node v, node w, int index) |
| | Creates a new edge (v,w) with predefined index and returns it.
|
| edge | newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::after) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| edge | newEdge (node v, adjEntry adjTgt) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| edge | newEdge (adjEntry adjSrc, node w) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| void | 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.
|
| virtual edge | split (edge e) |
| | Splits edge e into two edges introducing a new node.
|
| void | unsplit (node u) |
| | Undoes a split operation.
|
| virtual 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) |
| | 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.
|
| bool | consistencyCheck () const |
| | Checks the consistency of the data structure.
|
| 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.
|
Inheritance diagram for ogdf::ExtendedNestingGraph:
