|
| | EdgeWeightedGraph () |
| |
| | EdgeWeightedGraph (GraphCopy &gC) |
| |
| virtual | ~EdgeWeightedGraph () |
| |
| const EdgeArray< T > & | edgeWeights () const |
| |
| edge | newEdge (node v, node w, T weight) |
| |
| node | newNode () |
| |
| void | setWeight (const edge e, T weight) |
| |
| T | weight (const edge e) const |
| |
| | Graph () |
| | Constructs an empty graph.
|
| |
| | Graph (const Graph ©) |
| | Constructs a graph that is a copy of G.
|
| |
| | Graph (Graph &&move)=delete |
| |
| virtual | ~Graph () |
| | Destructor.
|
| |
| Graph & | operator= (const Graph ©) |
| | Overwrites this graph to be a copy of G.
|
| |
| Graph & | operator= (Graph &&move)=delete |
| |
| 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.
|
| |
| 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 (std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const |
| | Returns a random node.
|
| |
| edge | chooseEdge (std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const |
| | Returns a random edge.
|
| |
| template<class CONTAINER > |
| void | allNodes (CONTAINER &nodeContainer) const |
| | Returns a container with all nodes of the graph.
|
| |
| template<class CONTAINER > |
| void | allEdges (CONTAINER &edgeContainer) const |
| | Returns a container with all edges of the graph.
|
| |
| node | newNode (int index=-1) |
| | Creates a new node and returns it.
|
| |
| edge | newEdge (node v, node w, int index=-1) |
| | Creates a new edge (v,w) and returns it.
|
| |
| edge | newEdge (node v, adjEntry adjTgt, int index=-1) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| |
| edge | newEdge (adjEntry adjSrc, node w, int index=-1) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| |
| edge | newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| |
| template<typename S , typename T > |
| edge | newEdge (S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) |
| | Creates a new edge at predefined positions in the adjacency lists.
|
| |
| virtual void | delNode (node v) |
| | Removes node v and all incident edges from the graph.
|
| |
| virtual void | delEdge (edge e) |
| | Removes edge e from the graph.
|
| |
| virtual void | clear () |
| | Removes all nodes and all edges from the graph.
|
| |
| void | restoreAllEdges () |
| | Restore all hidden edges and invalidate all HiddenEdgeSets.
|
| |
| 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, bool keepSelfLoops=false) |
| | 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, bool directed=false) const |
| | Searches and returns an edge connecting nodes v and w in time O( min(deg(v ), deg(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 | collapse (NODELIST &nodesToCollapse) |
| | Collapses all nodes in the list nodesToCollapse 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.
|
| |
| template<class IT > |
| void | sort (node v, IT begin, IT end) |
| | Sorts the adjacency list of node v according to the range denoted by two iterators.
|
| |
| 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.
|
| |
| int | genus () const |
| | Returns the genus of the graph's embedding.
|
| |
| bool | representsCombEmbedding () const |
| | Returns true iff the graph represents a combinatorial embedding.
|
| |
| void | consistencyCheck () const |
| | Asserts that this graph is consistent.
|
| |
| internal::GraphNodeRegistry & | nodeRegistry () |
| | Returns a reference to the registry of node arrays associated with this graph.
|
| |
| const internal::GraphNodeRegistry & | nodeRegistry () const |
| | Returns a const reference to the registry of node arrays associated with this graph.
|
| |
| | operator const internal::GraphNodeRegistry & () const |
| |
| internal::GraphEdgeRegistry & | edgeRegistry () |
| | Returns a reference to the registry of edge arrays associated with this graph.
|
| |
| const internal::GraphEdgeRegistry & | edgeRegistry () const |
| | Returns a const reference to the registry of edge arrays associated with this graph.
|
| |
| | operator const internal::GraphEdgeRegistry & () const |
| |
| internal::GraphAdjRegistry & | adjEntryRegistry () |
| | Returns a reference to the registry of adjEntry arrays associated with this graph.
|
| |
| const internal::GraphAdjRegistry & | adjEntryRegistry () const |
| | Returns a const reference to the registry of adjEntry arrays associated with this graph.
|
| |
| | operator const internal::GraphAdjRegistry & () const |
| |
| void | resetEdgeIdCount (int maxId) |
| | Resets the edge id count to maxId.
|
| |
| void | resetNodeIdCount (int maxId) |
| |
| template<OGDF_NODE_ITER NI, OGDF_EDGE_ITER EI, bool copyEmbedding = true, bool copyIDs = false, bool notifyObservers = true> |
| std::pair< int, int > | insert (const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given subgraph into this graph.
|
| |
| template<OGDF_NODE_ITER NI, OGDF_EDGE_FILTER EF, bool copyIDs = false, bool notifyObservers = true> |
| std::pair< int, int > | insert (const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given subgraph into this graph.
|
| |
| template<OGDF_NODE_LIST NL> |
| std::pair< int, int > | insert (const NL &nodeList, const EdgeSet &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given subgraph into this graph.
|
| |
| template<OGDF_NODE_LIST NL, OGDF_EDGE_LIST EL> |
| std::pair< int, int > | insert (const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given subgraph into this graph.
|
| |
| std::pair< int, int > | insert (const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given connected component cc into this graph.
|
| |
| std::pair< int, int > | insert (const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) |
| | Inserts a copy of a given Graph G into this graph.
|
| |
| std::pair< int, int > | insert (const Graph &G) |
| | Inserts a copy of a given Graph G into this graph.
|
| |
| | Observable ()=default |
| |
| | Observable (const Observable ©)=delete |
| | If you want to copy a subclass of Observable, call the default Observable() constructor.
|
| |
| | Observable (Observable &&move)=delete |
| | If you want to move a subclass of Observable, call the default Observable() constructor.
|
| |
| virtual | ~Observable () |
| | Note that all Observers must already be removed once the destructor of this base class is invoked (e.g.
|
| |
| Observable & | operator= (const Observable ©)=delete |
| |
| Observable & | operator= (Observable &&move)=delete |
| |
Inheritance diagram for ogdf::EdgeWeightedGraph< T >:
