Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::FaceSinkGraph Member List

This is the complete list of members for ogdf::FaceSinkGraph, 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
checkForest()ogdf::FaceSinkGraphprivate
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
containsSource(node v) constogdf::FaceSinkGraphinline
contract(edge e, bool keepSelfLoops=false)ogdf::Graph
copy(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprivate
copy(const Graph &G)ogdf::Graphprivate
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt)ogdf::Graphprivate
delEdge(edge e)ogdf::Graphvirtual
delNode(node v)ogdf::Graphvirtual
dfsCheckForest(node v, node parent, NodeArray< bool > &visited, int &nInternalVertices)ogdf::FaceSinkGraphprivate
dfsFaceNodeOf(node v, node parent, face f1, face f2)ogdf::FaceSinkGraphprivate
dfsStAugmentation(node v, node parent, Graph &G, SList< node > &augmentedNodes, SList< edge > &augmentedEdges)ogdf::FaceSinkGraphprivate
dfsStAugmentation(node v, node parent, Graph &G, SList< edge > &augmentedEdges)ogdf::FaceSinkGraphprivate
doInit()ogdf::FaceSinkGraphprivate
edge_iterator typedefogdf::Graph
edgeArrayTableSize() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
empty() constogdf::Graphinline
faceNodeOf(edge e)ogdf::FaceSinkGraphinline
faceNodeOf(face f)ogdf::FaceSinkGraphinline
FaceSinkGraph(const ConstCombinatorialEmbedding &E, node s)ogdf::FaceSinkGraph
FaceSinkGraph()ogdf::FaceSinkGraphinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
gatherExternalFaces(node v, node parent, SList< face > &externalFaces)ogdf::FaceSinkGraphprivate
genus() constogdf::Graph
Graph()ogdf::Graph
Graph(const Graph &G)ogdf::Graph
init(const ConstCombinatorialEmbedding &E, node s)ogdf::FaceSinkGraph
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_containsSourceogdf::FaceSinkGraphprivate
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_originalFaceogdf::FaceSinkGraphprivate
m_originalNodeogdf::FaceSinkGraphprivate
m_pEogdf::FaceSinkGraphprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_sourceogdf::FaceSinkGraphprivate
m_Togdf::FaceSinkGraphprivate
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(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::Graph
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
operator=(const Graph &G)ogdf::Graph
originalEmbedding() constogdf::FaceSinkGraphinline
originalFace(node v) constogdf::FaceSinkGraphinline
originalGraph() constogdf::FaceSinkGraphinline
originalNode(node v) constogdf::FaceSinkGraphinline
possibleExternalFaces(SList< face > &externalFaces)ogdf::FaceSinkGraphinline
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
sinkSwitches(FaceArray< List< adjEntry > > &faceSwitches)ogdf::FaceSinkGraph
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
split(edge e)ogdf::Graphvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
stAugmentation(node h, Graph &G, SList< node > &augmentedNodes, SList< edge > &augmentedEdges)ogdf::FaceSinkGraph
stAugmentation(node h, Graph &G, node &superSink, SList< edge > &augmentedEdges)ogdf::FaceSinkGraph
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