Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::GraphCopySimple Member List

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

adjEntry_iterator typedefogdf::Graph
adjEntryArrayTableSize() constogdf::Graphinline
allEdges(CONTAINER &edgeContainer) constogdf::Graphinline
allNodes(CONTAINER &nodeContainer) constogdf::Graphinline
assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
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()ogdf::Graphvirtual
collapse(NODELIST &nodesToCollapse)ogdf::Graphinline
construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
constructInitByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
constructInitByCC(const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
constructInitByNodes(const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
contract(edge e, bool keepSelfLoops=false)ogdf::Graph
copy(node v) constogdf::GraphCopySimpleinline
copy(edge e) constogdf::GraphCopySimpleinline
copy(adjEntry adj) constogdf::GraphCopySimpleinline
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt)ogdf::Graphprivate
createEmpty(const Graph &G)ogdf::GraphCopySimple
delEdge(edge e) overrideogdf::GraphCopySimplevirtual
delNode(node v) overrideogdf::GraphCopySimplevirtual
edge_iterator typedefogdf::Graph
edgeArrayTableSize() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
empty() constogdf::Graphinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
Graph()ogdf::Graph
Graph(const Graph &G)ogdf::Graph
GraphCopySimple()ogdf::GraphCopySimple
GraphCopySimple(const Graph &G)ogdf::GraphCopySimpleexplicit
GraphCopySimple(const GraphCopySimple &GC)ogdf::GraphCopySimple
init(const Graph &G)ogdf::GraphCopySimple
initGC(const GraphCopySimple &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy)ogdf::GraphCopySimpleprivate
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
isDummy(node v) constogdf::GraphCopySimpleinline
isDummy(edge e) constogdf::GraphCopySimpleinline
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_eCopyogdf::GraphCopySimpleprivate
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_eOrigogdf::GraphCopySimpleprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_pGraphogdf::GraphCopySimpleprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_vCopyogdf::GraphCopySimpleprivate
m_vOrigogdf::GraphCopySimpleprivate
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
moveRegisterArray(ListIterator< ArrayBase * > it, ArrayBase *pArray) constogdf::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::GraphCopySimpleinline
newEdge(node v, node w)ogdf::GraphCopySimple
newEdge(node v, node w, int index)ogdf::GraphCopySimple
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)ogdf::GraphCopySimple
newEdge(node v, adjEntry adjTgt)ogdf::GraphCopySimple
newEdge(adjEntry adjSrc, node w)ogdf::GraphCopySimple
ogdf::Graph::newEdge(node v, node w)ogdf::Graph
ogdf::Graph::newEdge(node v, node w, int index)ogdf::Graph
ogdf::Graph::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)ogdf::Graph
ogdf::Graph::newEdge(node v, adjEntry adjTgt)ogdf::Graph
ogdf::Graph::newEdge(adjEntry adjSrc, node w)ogdf::Graph
newNode(node vOrig)ogdf::GraphCopySimpleinline
newNode()ogdf::GraphCopySimple
newNode(int index)ogdf::GraphCopySimple
ogdf::Graph::newNode(int index)ogdf::Graph
node_iterator typedefogdf::Graph
nodeArrayTableSize() constogdf::Graphinline
nodesogdf::Graph
NodeType enum nameogdf::Graph
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
operator=(const GraphCopySimple &GC)ogdf::GraphCopySimple
ogdf::Graph::operator=(const Graph &G)ogdf::Graph
original() constogdf::GraphCopySimpleinline
original(node v) constogdf::GraphCopySimpleinline
original(edge e) constogdf::GraphCopySimpleinline
original(adjEntry adj) constogdf::GraphCopySimpleinline
pureNewNode()ogdf::Graphprivate
registerArray(NodeArrayBase *pNodeArray) constogdf::Graph
registerArray(EdgeArrayBase *pEdgeArray) constogdf::Graph
registerArray(AdjEntryArrayBase *pAdjArray) constogdf::Graph
registerStructure(GraphObserver *pStructure) constogdf::Graph
reinitArrays(bool doResetTableSizes=true)ogdf::Graphprivate
reinitStructures()ogdf::Graphprivate
representsCombEmbedding() constogdf::Graphinline
resetAdjEntryIndex(int newIndex, int oldIndex)ogdf::Graphprivate
resetEdgeIdCount(int maxId)ogdf::Graph
resetTableSizes()ogdf::Graphprivate
restoreAllEdges()ogdf::Graphprivate
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
split(edge e)ogdf::Graphvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
swapAdjEdges(adjEntry adj1, adjEntry adj2)ogdf::Graphinline
unregisterArray(ListIterator< NodeArrayBase * > it) constogdf::Graph
unregisterArray(ListIterator< EdgeArrayBase * > it) constogdf::Graph
unregisterArray(ListIterator< AdjEntryArrayBase * > it) constogdf::Graph
unregisterStructure(ListIterator< GraphObserver * > it) constogdf::Graph
unsplit(node u)ogdf::Graph
unsplit(edge eIn, edge eOut)ogdf::Graphvirtual
~Graph()ogdf::Graphvirtual
~GraphCopySimple()ogdf::GraphCopySimpleinlinevirtual