Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

ogdf::OverlappingGraphCopy Member List

This is the complete list of members for ogdf::OverlappingGraphCopy, including all inherited members.

adjEntry_iterator typedefogdf::Graph
adjEntryRegistry()ogdf::Graphinline
adjEntryRegistry() constogdf::Graphinline
allEdges(CONTAINER &edgeContainer) constogdf::Graphinline
allNodes(CONTAINER &nodeContainer) constogdf::Graphinline
breakLinkForMasterDeconstruction()ogdf::OverlappingGraphCopyinline
chooseEdge(std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) constogdf::Graph
chooseNode(std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) constogdf::Graph
clear() overrideogdf::OverlappingGraphCopyinlinevirtual
clearObservers()ogdf::Observable< GraphObserver, Graph >inlineprotected
collapse(NODELIST &nodesToCollapse)ogdf::Graphinline
consistencyCheck() constogdf::Graph
contract(edge e, bool keepSelfLoops=false)ogdf::Graph
copy(node v) constogdf::OverlappingGraphCopy
copy(edge e) constogdf::OverlappingGraphCopy
copy(adjEntry adj) constogdf::OverlappingGraphCopyinline
delEdge(edge e) overrideogdf::OverlappingGraphCopyvirtual
delNode(node v) overrideogdf::OverlappingGraphCopyvirtual
edge_iterator typedefogdf::Graph
edgeInserted(void *userData, edge original, edge copy)ogdf::Graphinlineprotectedvirtual
edgeRegistry()ogdf::Graphinline
edgeRegistry() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
empty() constogdf::Graphinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
getObservers() constogdf::Observable< GraphObserver, Graph >inlineprotected
Graph()ogdf::Graph
Graph(const Graph &copy)ogdf::Graph
Graph(Graph &&move)=deleteogdf::Graph
insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graph
insert(const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graph
insert(const NL &nodeList, const EdgeSet< true > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graph
insert(const NL &nodeList, const EdgeSet< false > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graph
insert(const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graphinline
insert(const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graphinline
insert(const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)ogdf::Graphinline
insert(const Graph &G)ogdf::Graphinline
insertAdjEntry(adjEntry oldAdj, adjEntry newAdj, Direction dir)ogdf::Graphinlineprivatestatic
insertAdjEntry(node n, adjEntry newAdj, Direction dir)ogdf::Graphinlineprivatestatic
insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData)ogdf::Graphprivate
isDummy(node v) constogdf::OverlappingGraphCopyinline
isDummy(edge e) constogdf::OverlappingGraphCopyinline
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_edgeIdCountogdf::Graphprivate
m_eOrigogdf::OverlappingGraphCopyprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_mutexRegArraysogdf::Observable< GraphObserver, Graph >mutableprivate
m_nodeIdCountogdf::Graphprivate
m_pOGCogdf::OverlappingGraphCopyprivate
m_regAdjArraysogdf::Graphprivate
m_regEdgeArraysogdf::Graphprivate
m_regNodeArraysogdf::Graphprivate
m_regObserversogdf::Observable< GraphObserver, Graph >mutableprivate
m_vOrigogdf::OverlappingGraphCopyprivate
master() constogdf::OverlappingGraphCopyinline
maxAdjEntryIndex() constogdf::Graphinline
maxEdgeIndex() constogdf::Graphinline
maxNodeIndex() constogdf::Graphinline
move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)ogdf::Graph
moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos)ogdf::Graphinline
moveAdj(adjEntry adj, node w)ogdf::Graphprivate
moveAdjAfter(adjEntry adjMove, adjEntry adjAfter)ogdf::Graphinline
moveAdjBefore(adjEntry adjMove, adjEntry adjBefore)ogdf::Graphinline
moveSource(edge e, node w)ogdf::Graph
moveSource(edge e, adjEntry adjSrc, Direction dir)ogdf::Graph
moveTarget(edge e, node w)ogdf::Graph
moveTarget(edge e, adjEntry adjTgt, Direction dir)ogdf::Graph
newEdge(edge eOrig)ogdf::OverlappingGraphCopy
newEdge(node v, node w, int index=-1)ogdf::OverlappingGraphCopyinline
newEdge(node v, adjEntry adjTgt, int index=-1)ogdf::OverlappingGraphCopyinline
newEdge(adjEntry adjSrc, node w, int index=-1)ogdf::OverlappingGraphCopyinline
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)ogdf::OverlappingGraphCopyinline
newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)ogdf::OverlappingGraphCopyinline
ogdf::Graph::newEdge(node v, node w, int index=-1)ogdf::Graphinline
ogdf::Graph::newEdge(node v, adjEntry adjTgt, int index=-1)ogdf::Graphinline
ogdf::Graph::newEdge(adjEntry adjSrc, node w, int index=-1)ogdf::Graphinline
ogdf::Graph::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)ogdf::Graphinline
ogdf::Graph::newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)ogdf::Graphinline
newNode(node vOrig)ogdf::OverlappingGraphCopy
newNode(int index=-1)ogdf::OverlappingGraphCopyinline
ogdf::Graph::newNode(int index=-1)ogdf::Graphinline
node_iterator typedefogdf::Graph
nodeInserted(void *userData, node original, node copy)ogdf::Graphinlineprotectedvirtual
nodeRegistry()ogdf::Graphinline
nodeRegistry() constogdf::Graphinline
nodesogdf::Graph
NodeType enum nameogdf::Graph
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
Observable()=defaultogdf::Observable< GraphObserver, Graph >
Observable(const Observable &copy)=deleteogdf::Observable< GraphObserver, Graph >
Observable(Observable &&move)=deleteogdf::Observable< GraphObserver, Graph >
Observer< TObserved, TObserver >ogdf::Observable< GraphObserver, Graph >private
operator const internal::GraphAdjRegistry &() constogdf::Graphinline
operator const internal::GraphEdgeRegistry &() constogdf::Graphinline
operator const internal::GraphNodeRegistry &() constogdf::Graphinline
operator=(OverlappingGraphCopy &&move)=deleteogdf::OverlappingGraphCopy
operator=(const OverlappingGraphCopy &copy)=deleteogdf::OverlappingGraphCopy
ogdf::Graph::operator=(const Graph &copy)ogdf::Graph
ogdf::Graph::operator=(Graph &&move)=deleteogdf::Graph
Observable< GraphObserver, Graph >::operator=(const Observable &copy)=deleteogdf::Observable< GraphObserver, Graph >
Observable< GraphObserver, Graph >::operator=(Observable &&move)=deleteogdf::Observable< GraphObserver, Graph >
original() constogdf::OverlappingGraphCopy
original(node v) constogdf::OverlappingGraphCopyinline
original(edge e) constogdf::OverlappingGraphCopyinline
original(adjEntry adj) constogdf::OverlappingGraphCopyinline
OverlappingGraphCopies classogdf::OverlappingGraphCopyfriend
OverlappingGraphCopy(OverlappingGraphCopies &mPOgc)ogdf::OverlappingGraphCopyinlineexplicit
OverlappingGraphCopy(OverlappingGraphCopy &&move)=deleteogdf::OverlappingGraphCopy
OverlappingGraphCopy(const OverlappingGraphCopy &copy)=deleteogdf::OverlappingGraphCopy
postInsert(void *userData, int newNodes, int newEdges)ogdf::Graphinlineprotectedvirtual
preInsert(bool copyEmbedding, bool copyIDs, bool notifyObservers, bool edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap, int *newNodes, int *newEdges)ogdf::Graphinlineprotectedvirtual
pureNewEdge(node src, node tgt, int index)ogdf::Graphinlineprivate
pureNewNode(int index)ogdf::Graphinlineprivate
registerObserver(GraphObserver *obs) constogdf::Observable< GraphObserver, Graph >inlineprivate
representsCombEmbedding() constogdf::Graphinline
resetEdgeIdCount(int maxId)ogdf::Graph
resetNodeIdCount(int maxId)ogdf::Graph
restoreAllEdges()ogdf::Graph
reverseAdjEdges(node v)ogdf::Graphinline
reverseAdjEdges()ogdf::Graph
reverseAllEdges()ogdf::Graph
reverseEdge(edge e)ogdf::Graph
searchEdge(node v, node w, bool directed=false) constogdf::Graph
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
sort(node v, IT begin, IT end)ogdf::Graphinline
split(edge e)ogdf::Graphvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
swapAdjEdges(adjEntry adj1, adjEntry adj2)ogdf::Graphinline
unmap()ogdf::OverlappingGraphCopyprivate
unregisterObserver(typename ListPure< GraphObserver * >::iterator it) constogdf::Observable< GraphObserver, Graph >inlineprivate
unsplit(node u)ogdf::Graph
unsplit(edge eIn, edge eOut)ogdf::Graphvirtual
~Graph()ogdf::Graphvirtual
~Observable()ogdf::Observable< GraphObserver, Graph >inlinevirtual
~OverlappingGraphCopy() overrideogdf::OverlappingGraphCopyinline