addEdge(node u, node v, bool addAlways=false) | ogdf::ExtendedNestingGraph | protected |
adjEntry_iterator typedef | ogdf::Graph | |
adjEntryArrayTableSize() const | ogdf::Graph | inline |
aeLevel(node v) const | ogdf::ExtendedNestingGraph | inline |
allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
assignAeLevel(cluster c, int &count) | ogdf::ExtendedNestingGraph | protected |
assignPos(const LHTreeNode *vNode, int &count) | ogdf::ExtendedNestingGraph | protected |
bottom(cluster cOrig) const | ogdf::ExtendedNestingGraph | inline |
bottomRank(cluster c) const | ogdf::ExtendedNestingGraph | inline |
buildLayers() | ogdf::ExtendedNestingGraph | private |
chain(edge e) const | ogdf::ExtendedNestingGraph | inline |
chooseEdge(std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
chooseNode(std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
clear() | ogdf::Graph | virtual |
collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
computeRanking() | ogdf::ExtendedNestingGraph | private |
construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
constructInitByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
constructInitByCC(const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
constructInitByNodes(const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
copy(node v) const | ogdf::ExtendedNestingGraph | inline |
createDummyNodes() | ogdf::ExtendedNestingGraph | private |
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) | ogdf::Graph | private |
createVirtualClusters() | ogdf::ExtendedNestingGraph | private |
createVirtualClusters(cluster c, NodeArray< node > &vCopy, ClusterArray< node > &cCopy) | ogdf::ExtendedNestingGraph | private |
delEdge(edge e) | ogdf::Graph | virtual |
delNode(node v) | ogdf::Graph | virtual |
edge_iterator typedef | ogdf::Graph | |
edgeArrayTableSize() const | ogdf::Graph | inline |
edges | ogdf::Graph | |
EdgeType enum name | ogdf::Graph | |
empty() const | ogdf::Graph | inline |
ExtendedNestingGraph(const ClusterGraph &CG) | ogdf::ExtendedNestingGraph | explicit |
firstEdge() const | ogdf::Graph | inline |
firstNode() const | ogdf::Graph | inline |
genus() const | ogdf::Graph | |
getClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
getOriginalClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
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) const | ogdf::ExtendedNestingGraph | inline |
isReversed(edge e) const | ogdf::ExtendedNestingGraph | inline |
isVirtual(cluster c) const | ogdf::ExtendedNestingGraph | inline |
lastEdge() const | ogdf::Graph | inline |
lastNode() const | ogdf::Graph | inline |
layer(int i) const | ogdf::ExtendedNestingGraph | inline |
layerHierarchyTree(int i) const | ogdf::ExtendedNestingGraph | inline |
lca(node u, node v) const | ogdf::ExtendedNestingGraph | protected |
lca(LHTreeNode *uNode, LHTreeNode *vNode, LHTreeNode **uChild, LHTreeNode **vChild) const | ogdf::ExtendedNestingGraph | protected |
m_aeLevel | ogdf::ExtendedNestingGraph | private |
m_aeVisited | ogdf::ExtendedNestingGraph | private |
m_auxDeg | ogdf::ExtendedNestingGraph | private |
m_bottomNode | ogdf::ExtendedNestingGraph | private |
m_bottomRank | ogdf::ExtendedNestingGraph | private |
m_CGC | ogdf::ExtendedNestingGraph | private |
m_copy | ogdf::ExtendedNestingGraph | private |
m_copyEdge | ogdf::ExtendedNestingGraph | private |
m_edgeArrayTableSize | ogdf::Graph | private |
m_edgeIdCount | ogdf::Graph | private |
m_hiddenEdgeSets | ogdf::Graph | private |
m_layer | ogdf::ExtendedNestingGraph | private |
m_mark | ogdf::ExtendedNestingGraph | mutableprivate |
m_markedClusters | ogdf::ExtendedNestingGraph | mutableprivate |
m_markedClustersTree | ogdf::ExtendedNestingGraph | mutableprivate |
m_markTree | ogdf::ExtendedNestingGraph | mutableprivate |
m_mutexRegArrays | ogdf::Graph | mutableprivate |
m_nodeArrayTableSize | ogdf::Graph | private |
m_nodeIdCount | ogdf::Graph | private |
m_numLayers | ogdf::ExtendedNestingGraph | private |
m_origEdge | ogdf::ExtendedNestingGraph | private |
m_origNode | ogdf::ExtendedNestingGraph | private |
m_pos | ogdf::ExtendedNestingGraph | private |
m_rank | ogdf::ExtendedNestingGraph | private |
m_regAdjArrays | ogdf::Graph | mutableprivate |
m_regEdgeArrays | ogdf::Graph | mutableprivate |
m_regNodeArrays | ogdf::Graph | mutableprivate |
m_regStructures | ogdf::Graph | mutableprivate |
m_secondPath | ogdf::ExtendedNestingGraph | mutableprivate |
m_secondPathTo | ogdf::ExtendedNestingGraph | mutableprivate |
m_topNode | ogdf::ExtendedNestingGraph | private |
m_topRank | ogdf::ExtendedNestingGraph | private |
m_type | ogdf::ExtendedNestingGraph | private |
m_vertical | ogdf::ExtendedNestingGraph | private |
maxAdjEntryIndex() const | ogdf::Graph | inline |
maxEdgeIndex() const | ogdf::Graph | inline |
maxNodeIndex() const | ogdf::Graph | inline |
move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt) | ogdf::Graph | |
moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) | ogdf::Graph | inline |
moveAdj(adjEntry adj, node w) | ogdf::Graph | private |
moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) | ogdf::Graph | inline |
moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) | ogdf::Graph | inline |
moveDown(node v, const SListPure< node > &successors, NodeArray< int > &level) | ogdf::ExtendedNestingGraph | protected |
moveRegisterArray(ListIterator< ArrayBase * > it, ArrayBase *pArray) const | ogdf::Graph | inline |
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 typedef | ogdf::Graph | |
nodeArrayTableSize() const | ogdf::Graph | inline |
nodes | ogdf::Graph | |
NodeType enum name | ogdf::ExtendedNestingGraph | |
numberOfEdges() const | ogdf::Graph | inline |
numberOfLayers() const | ogdf::ExtendedNestingGraph | inline |
numberOfNodes() const | ogdf::Graph | inline |
operator=(const Graph &G) | ogdf::Graph | |
origEdge(edge e) const | ogdf::ExtendedNestingGraph | inline |
originalCluster(node v) const | ogdf::ExtendedNestingGraph | inline |
origNode(node v) const | ogdf::ExtendedNestingGraph | inline |
parent(node v) const | ogdf::ExtendedNestingGraph | inline |
parent(cluster c) const | ogdf::ExtendedNestingGraph | inline |
permute() | ogdf::ExtendedNestingGraph | |
pos(node v) const | ogdf::ExtendedNestingGraph | inline |
pureNewNode() | ogdf::Graph | private |
rank(node v) const | ogdf::ExtendedNestingGraph | inline |
reachable(node v, node u, SListPure< node > &successors) | ogdf::ExtendedNestingGraph | protected |
reduceCrossings(int i, bool dirTopDown) | ogdf::ExtendedNestingGraph | |
reduceCrossings(LHTreeNode *cNode, bool dirTopDown) | ogdf::ExtendedNestingGraph | protected |
registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | |
registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | |
registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | |
registerStructure(GraphObserver *pStructure) const | ogdf::Graph | |
reinitArrays(bool doResetTableSizes=true) | ogdf::Graph | private |
removeAuxNodes() | ogdf::ExtendedNestingGraph | private |
removeTopBottomEdges() | ogdf::ExtendedNestingGraph | |
representsCombEmbedding() const | ogdf::Graph | inline |
resetAdjEntryIndex(int newIndex, int oldIndex) | ogdf::Graph | private |
resetEdgeIdCount(int maxId) | ogdf::Graph | |
resetTableSizes() | ogdf::Graph | private |
restoreAllEdges() | ogdf::Graph | private |
restorePos() | ogdf::ExtendedNestingGraph | |
reverseAdjEdges(node v) | ogdf::Graph | inline |
reverseAdjEdges() | ogdf::Graph | |
reverseAllEdges() | ogdf::Graph | |
reverseEdge(edge e) | ogdf::Graph | |
searchEdge(node v, node w, bool directed=false) const | ogdf::Graph | |
sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
split(edge e) | ogdf::Graph | virtual |
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
storeCurrentPos() | ogdf::ExtendedNestingGraph | |
swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
top(cluster cOrig) const | ogdf::ExtendedNestingGraph | inline |
topRank(cluster c) const | ogdf::ExtendedNestingGraph | inline |
tryEdge(node u, node v, Graph &G, NodeArray< int > &level) | ogdf::ExtendedNestingGraph | protected |
type(node v) const | ogdf::ExtendedNestingGraph | inline |
unregisterArray(ListIterator< NodeArrayBase * > it) const | ogdf::Graph | |
unregisterArray(ListIterator< EdgeArrayBase * > it) const | ogdf::Graph | |
unregisterArray(ListIterator< AdjEntryArrayBase * > it) const | ogdf::Graph | |
unregisterStructure(ListIterator< GraphObserver * > it) const | ogdf::Graph | |
unsplit(node u) | ogdf::Graph | |
unsplit(edge eIn, edge eOut) | ogdf::Graph | virtual |
verticalSegment(edge e) const | ogdf::ExtendedNestingGraph | inline |
~Graph() | ogdf::Graph | virtual |