Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::ExtendedNestingGraph Member List

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

addEdge(node u, node v, bool addAlways=false)ogdf::ExtendedNestingGraphprotected
adjEntry_iterator typedefogdf::Graph
adjEntryArrayTableSize() constogdf::Graphinline
aeLevel(node v) constogdf::ExtendedNestingGraphinline
allEdges(CONTAINER &edgeContainer) constogdf::Graphinline
allNodes(CONTAINER &nodeContainer) constogdf::Graphinline
assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
assignAeLevel(cluster c, int &count)ogdf::ExtendedNestingGraphprotected
assignPos(const LHTreeNode *vNode, int &count)ogdf::ExtendedNestingGraphprotected
bottom(cluster cOrig) constogdf::ExtendedNestingGraphinline
bottomRank(cluster c) constogdf::ExtendedNestingGraphinline
buildLayers()ogdf::ExtendedNestingGraphprivate
chain(edge e) constogdf::ExtendedNestingGraphinline
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
computeRanking()ogdf::ExtendedNestingGraphprivate
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::ExtendedNestingGraphinline
createDummyNodes()ogdf::ExtendedNestingGraphprivate
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt)ogdf::Graphprivate
createVirtualClusters()ogdf::ExtendedNestingGraphprivate
createVirtualClusters(cluster c, NodeArray< node > &vCopy, ClusterArray< node > &cCopy)ogdf::ExtendedNestingGraphprivate
delEdge(edge e)ogdf::Graphvirtual
delNode(node v)ogdf::Graphvirtual
edge_iterator typedefogdf::Graph
edgeArrayTableSize() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
empty() constogdf::Graphinline
ExtendedNestingGraph(const ClusterGraph &CG)ogdf::ExtendedNestingGraphexplicit
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
getClusterGraph() constogdf::ExtendedNestingGraphinline
getOriginalClusterGraph() constogdf::ExtendedNestingGraphinline
Graph()ogdf::Graph
Graph(const Graph &G)ogdf::Graph
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
isLongEdgeDummy(node v) constogdf::ExtendedNestingGraphinline
isReversed(edge e) constogdf::ExtendedNestingGraphinline
isVirtual(cluster c) constogdf::ExtendedNestingGraphinline
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
layer(int i) constogdf::ExtendedNestingGraphinline
layerHierarchyTree(int i) constogdf::ExtendedNestingGraphinline
lca(node u, node v) constogdf::ExtendedNestingGraphprotected
lca(LHTreeNode *uNode, LHTreeNode *vNode, LHTreeNode **uChild, LHTreeNode **vChild) constogdf::ExtendedNestingGraphprotected
m_aeLevelogdf::ExtendedNestingGraphprivate
m_aeVisitedogdf::ExtendedNestingGraphprivate
m_auxDegogdf::ExtendedNestingGraphprivate
m_bottomNodeogdf::ExtendedNestingGraphprivate
m_bottomRankogdf::ExtendedNestingGraphprivate
m_CGCogdf::ExtendedNestingGraphprivate
m_copyogdf::ExtendedNestingGraphprivate
m_copyEdgeogdf::ExtendedNestingGraphprivate
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_layerogdf::ExtendedNestingGraphprivate
m_markogdf::ExtendedNestingGraphmutableprivate
m_markedClustersogdf::ExtendedNestingGraphmutableprivate
m_markedClustersTreeogdf::ExtendedNestingGraphmutableprivate
m_markTreeogdf::ExtendedNestingGraphmutableprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_numLayersogdf::ExtendedNestingGraphprivate
m_origEdgeogdf::ExtendedNestingGraphprivate
m_origNodeogdf::ExtendedNestingGraphprivate
m_posogdf::ExtendedNestingGraphprivate
m_rankogdf::ExtendedNestingGraphprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_secondPathogdf::ExtendedNestingGraphmutableprivate
m_secondPathToogdf::ExtendedNestingGraphmutableprivate
m_topNodeogdf::ExtendedNestingGraphprivate
m_topRankogdf::ExtendedNestingGraphprivate
m_typeogdf::ExtendedNestingGraphprivate
m_verticalogdf::ExtendedNestingGraphprivate
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
moveDown(node v, const SListPure< node > &successors, NodeArray< int > &level)ogdf::ExtendedNestingGraphprotected
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(node v, node w)ogdf::Graph
newEdge(node v, node w, int index)ogdf::Graph
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)ogdf::Graph
newEdge(node v, adjEntry adjTgt)ogdf::Graph
newEdge(adjEntry adjSrc, node w)ogdf::Graph
newNode()ogdf::Graph
newNode(int index)ogdf::Graph
node_iterator typedefogdf::Graph
nodeArrayTableSize() constogdf::Graphinline
nodesogdf::Graph
NodeType enum nameogdf::ExtendedNestingGraph
numberOfEdges() constogdf::Graphinline
numberOfLayers() constogdf::ExtendedNestingGraphinline
numberOfNodes() constogdf::Graphinline
operator=(const Graph &G)ogdf::Graph
origEdge(edge e) constogdf::ExtendedNestingGraphinline
originalCluster(node v) constogdf::ExtendedNestingGraphinline
origNode(node v) constogdf::ExtendedNestingGraphinline
parent(node v) constogdf::ExtendedNestingGraphinline
parent(cluster c) constogdf::ExtendedNestingGraphinline
permute()ogdf::ExtendedNestingGraph
pos(node v) constogdf::ExtendedNestingGraphinline
pureNewNode()ogdf::Graphprivate
rank(node v) constogdf::ExtendedNestingGraphinline
reachable(node v, node u, SListPure< node > &successors)ogdf::ExtendedNestingGraphprotected
reduceCrossings(int i, bool dirTopDown)ogdf::ExtendedNestingGraph
reduceCrossings(LHTreeNode *cNode, bool dirTopDown)ogdf::ExtendedNestingGraphprotected
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
removeAuxNodes()ogdf::ExtendedNestingGraphprivate
removeTopBottomEdges()ogdf::ExtendedNestingGraph
representsCombEmbedding() constogdf::Graphinline
resetAdjEntryIndex(int newIndex, int oldIndex)ogdf::Graphprivate
resetEdgeIdCount(int maxId)ogdf::Graph
resetTableSizes()ogdf::Graphprivate
restoreAllEdges()ogdf::Graphprivate
restorePos()ogdf::ExtendedNestingGraph
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
storeCurrentPos()ogdf::ExtendedNestingGraph
swapAdjEdges(adjEntry adj1, adjEntry adj2)ogdf::Graphinline
top(cluster cOrig) constogdf::ExtendedNestingGraphinline
topRank(cluster c) constogdf::ExtendedNestingGraphinline
tryEdge(node u, node v, Graph &G, NodeArray< int > &level)ogdf::ExtendedNestingGraphprotected
type(node v) constogdf::ExtendedNestingGraphinline
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
verticalSegment(edge e) constogdf::ExtendedNestingGraphinline
~Graph()ogdf::Graphvirtual