Open
Graph Drawing
Framework

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

ogdf::GraphCopy Member List

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

adjEntry_iterator typedefogdf::Graph
adjEntryRegistry()ogdf::Graphinline
adjEntryRegistry() constogdf::Graphinline
allEdges(CONTAINER &edgeContainer) constogdf::Graphinline
allNodes(CONTAINER &nodeContainer) constogdf::Graphinline
chain(edge e) constogdf::GraphCopyinline
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::GraphCopyvirtual
clearObservers()ogdf::Observable< GraphObserver, Graph >inlineprotected
collapse(NODELIST &nodesToCollapse)ogdf::Graphinline
consistencyCheck() constogdf::GraphCopy
contract(edge e, bool keepSelfLoops=false)ogdf::Graph
copy(edge e) const overrideogdf::GraphCopyinlinevirtual
copy(adjEntry adj) const overrideogdf::GraphCopyinlinevirtual
copy(node v) constogdf::GraphCopyinline
copy(edge e) const=0ogdf::GraphCopy
copy(adjEntry adj) const=0ogdf::GraphCopy
ogdf::GraphCopyBase::copy(node v) constogdf::GraphCopyBaseinline
createEmpty(const Graph &G)ogdf::GraphCopyBaseinline
delEdge(edge e) overrideogdf::GraphCopyvirtual
delNode(node v) overrideogdf::GraphCopyBaseinlinevirtual
edge_iterator typedefogdf::Graph
edgeInserted(void *userData, edge original, edge copy) overrideogdf::GraphCopyprotectedvirtual
edgeRegistry()ogdf::Graphinline
edgeRegistry() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
empty() constogdf::Graphinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
getLinkCopiesOnInsert() constogdf::GraphCopyBaseinline
getObservers() constogdf::Observable< GraphObserver, Graph >inlineprotected
getOriginalGraph() constogdf::GraphCopyBaseinline
Graph()ogdf::Graph
Graph(const Graph &copy)ogdf::Graph
Graph(Graph &&move)=deleteogdf::Graph
GraphCopy()ogdf::GraphCopyinlineexplicit
GraphCopy(const Graph &G)ogdf::GraphCopyinlineexplicit
GraphCopy(const Graph *G)ogdf::GraphCopyinlineexplicit
GraphCopy(const GraphCopy &other)ogdf::GraphCopyinline
GraphCopyBase()=defaultogdf::GraphCopyBase
GraphCopyBase(const GraphCopyBase &other)=deleteogdf::GraphCopyBase
GraphCopyBase(GraphCopyBase &&other) noexcept=deleteogdf::GraphCopyBase
hasAdjacentEdgesCrossings() constogdf::GraphCopy
hasNonSimpleCrossings() constogdf::GraphCopyinline
hasSameEdgesCrossings() constogdf::GraphCopy
init(const Graph &G)ogdf::GraphCopyBaseinline
init(const Graph *G)ogdf::GraphCopyBaseinline
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
insertCrossing(edge &crossingEdge, edge crossedEdge, bool rightToLeft)ogdf::GraphCopy
insertEdgePath(edge eOrig, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePath(node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData)ogdf::Graphprivate
isDummy(node v) constogdf::GraphCopyBaseinline
isDummy(edge e) constogdf::GraphCopyBaseinline
isDummy(adjEntry adj) constogdf::GraphCopyBaseinline
isReversed(edge e) constogdf::GraphCopyinline
isReversedCopyEdge(edge e) constogdf::GraphCopy
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_eCopyogdf::GraphCopyprotected
m_edgeIdCountogdf::Graphprivate
m_eIteratorogdf::GraphCopyprotected
m_eOrigogdf::GraphCopyBaseprotected
m_hiddenEdgeSetsogdf::Graphprivate
m_linkCopiesOnInsertogdf::GraphCopyBaseprotected
m_mutexRegArraysogdf::Observable< GraphObserver, Graph >mutableprivate
m_nodeIdCountogdf::Graphprivate
m_pGraphogdf::GraphCopyBaseprotected
m_regAdjArraysogdf::Graphprivate
m_regEdgeArraysogdf::Graphprivate
m_regNodeArraysogdf::Graphprivate
m_regObserversogdf::Observable< GraphObserver, Graph >mutableprivate
m_vCopyogdf::GraphCopyBaseprotected
m_vOrigogdf::GraphCopyBaseprotected
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::GraphCopy
newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E)ogdf::GraphCopy
newEdge(node v, node w, int index=-1)ogdf::GraphCopyinline
newEdge(node v, adjEntry adjTgt, int index=-1)ogdf::GraphCopyinline
newEdge(adjEntry adjSrc, node w, int index=-1)ogdf::GraphCopyinline
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)ogdf::GraphCopyinline
newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)ogdf::GraphCopyinline
ogdf::GraphCopyBase::newEdge(node v, node w, int index=-1)ogdf::Graphinline
ogdf::GraphCopyBase::newEdge(node v, adjEntry adjTgt, int index=-1)ogdf::Graphinline
ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, node w, int index=-1)ogdf::Graphinline
ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)ogdf::Graphinline
ogdf::GraphCopyBase::newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)ogdf::Graphinline
newNode(node vOrig)ogdf::GraphCopyBaseinline
newNode(int index=-1)ogdf::GraphCopyBaseinline
ogdf::Graph::newNode(int index=-1)ogdf::Graphinline
node_iterator typedefogdf::Graph
nodeInserted(void *userData, node original, node copy) overrideogdf::GraphCopyBaseprotectedvirtual
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=(const GraphCopy &other)ogdf::GraphCopy
ogdf::GraphCopyBase::operator=(const GraphCopyBase &other)=deleteogdf::GraphCopyBase
ogdf::GraphCopyBase::operator=(GraphCopyBase &&other) noexcept=deleteogdf::GraphCopyBase
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::GraphCopyBaseinline
original(node v) constogdf::GraphCopyBaseinline
original(edge e) constogdf::GraphCopyBaseinline
original(adjEntry adj) constogdf::GraphCopyBaseinline
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) overrideogdf::GraphCopyBaseprotectedvirtual
pureNewEdge(node src, node tgt, int index)ogdf::Graphinlineprivate
pureNewNode(int index)ogdf::Graphinlineprivate
registerObserver(GraphObserver *obs) constogdf::Observable< GraphObserver, Graph >inlineprivate
removeAdjacentEdgesCrossing(adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
removeEdgePath(edge eOrig)ogdf::GraphCopy
removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)ogdf::GraphCopy
removeEdgePathEmbedded(CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig)ogdf::GraphCopy
removeNonSimpleCrossings(SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopy
removeNonSimpleCrossings(DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopyinline
removeNonSimpleCrossings(node origNode, DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopyinline
removePseudoCrossings()ogdf::GraphCopy
removeSameEdgesCrossing(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
removeUnnecessaryCrossing(adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)ogdf::GraphCopyprotected
removeUnnecessaryCrossing(adjEntry adj, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
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
setEdge(edge eOrig, edge eCopy)ogdf::GraphCopy
setLinkCopiesOnInsert(bool linkCopiesOnInsert)ogdf::GraphCopyBaseinline
setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2)ogdf::GraphCopyprotected
setOriginalEmbedding() overrideogdf::GraphCopyvirtual
setOriginalGraph(const Graph *G) overrideogdf::GraphCopyvirtual
setOriginalGraph(const Graph *G)=0ogdf::GraphCopy
setOriginalGraph(const Graph &G)ogdf::GraphCopyinline
ogdf::GraphCopyBase::setOriginalGraph(const Graph &G)ogdf::GraphCopyBaseinline
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
sort(node v, IT begin, IT end)ogdf::Graphinline
split(edge e) overrideogdf::GraphCopyvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
swapAdjEdges(adjEntry adj1, adjEntry adj2)ogdf::Graphinline
swapOriginalEdgesAtCrossing(adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr)ogdf::GraphCopyprotected
swapOriginalEdgesBetweenCrossings(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr)ogdf::GraphCopyprotected
unregisterObserver(typename ListPure< GraphObserver * >::iterator it) constogdf::Observable< GraphObserver, Graph >inlineprivate
unsplit(edge eIn, edge eOut) overrideogdf::GraphCopyvirtual
ogdf::GraphCopyBase::unsplit(node u)ogdf::Graph
~Graph()ogdf::Graphvirtual
~Observable()ogdf::Observable< GraphObserver, Graph >inlinevirtual