Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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

This is the complete list of members for ogdf::PlanRepExpansion, 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
chain(edge eOrig) constogdf::PlanRepExpansioninline
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
computeNumberOfCrossings() constogdf::PlanRepExpansion
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
contractSplit(nodeSplit ns, CombinatorialEmbedding &E)ogdf::PlanRepExpansion
contractSplit(nodeSplit ns)ogdf::PlanRepExpansion
convertDummy(node u, node vOrig, PlanRepExpansion::nodeSplit ns)ogdf::PlanRepExpansion
copy(node vOrig) constogdf::PlanRepExpansioninline
copy(edge eOrig) constogdf::PlanRepExpansioninline
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt)ogdf::Graphprivate
currentCC() constogdf::PlanRepExpansioninline
delEdge(edge e) overrideogdf::PlanRepExpansionvirtual
delNode(node v)ogdf::Graphvirtual
doInit(const Graph &G, const List< node > &splittableNodes)ogdf::PlanRepExpansionprivate
edge_iterator typedefogdf::Graph
edgeArrayTableSize() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
embed()ogdf::PlanRepExpansion
empty() constogdf::Graphinline
enlargeSplit(node v, edge e, CombinatorialEmbedding &E)ogdf::PlanRepExpansion
enlargeSplit(node v, edge e)ogdf::PlanRepExpansion
expansion(node vOrig) constogdf::PlanRepExpansioninline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
Graph()ogdf::Graph
Graph(const Graph &G)ogdf::Graph
initCC(int i)ogdf::PlanRepExpansion
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
insertEdgePath(edge eOrig, nodeSplit ns, node vStart, node vEnd, List< Crossing > &eip, edge eSrc, edge eTgt)ogdf::PlanRepExpansion
insertEdgePathEmbedded(edge eOrig, nodeSplit ns, CombinatorialEmbedding &E, const List< Tuple2< adjEntry, adjEntry > > &crossedEdges)ogdf::PlanRepExpansion
isPseudoCrossing(node v) constogdf::PlanRepExpansion
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_currentCCogdf::PlanRepExpansionprivate
m_eAuxCopyogdf::PlanRepExpansionprivate
m_eCopyogdf::PlanRepExpansionprivate
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_eIteratorogdf::PlanRepExpansionprivate
m_eNodeSplitogdf::PlanRepExpansionprivate
m_eOrigogdf::PlanRepExpansionprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_nodesInCCogdf::PlanRepExpansionprivate
m_nodeSplitsogdf::PlanRepExpansionprivate
m_numCCogdf::PlanRepExpansionprivate
m_pGraphogdf::PlanRepExpansionprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_splittableogdf::PlanRepExpansionprivate
m_splittableOrigogdf::PlanRepExpansionprivate
m_vCopyogdf::PlanRepExpansionprivate
m_vIteratorogdf::PlanRepExpansionprivate
m_vOrigogdf::PlanRepExpansionprivate
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
nodesInCC(int i) constogdf::PlanRepExpansioninline
nodesInCC() constogdf::PlanRepExpansioninline
nodeSplit typedefogdf::PlanRepExpansion
nodeSplitOf(edge e) constogdf::PlanRepExpansioninline
nodeSplits()ogdf::PlanRepExpansioninline
NodeType enum nameogdf::Graph
numberOfCCs() constogdf::PlanRepExpansioninline
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
numberOfNodeSplits() constogdf::PlanRepExpansioninline
numberOfSplittedNodes() constogdf::PlanRepExpansion
operator=(const Graph &G)ogdf::Graph
original() constogdf::PlanRepExpansioninline
original(node v) constogdf::PlanRepExpansioninline
originalEdge(edge e) constogdf::PlanRepExpansioninline
PlanRepExpansion(const Graph &G)ogdf::PlanRepExpansion
PlanRepExpansion(const Graph &G, const List< node > &splittableNodes)ogdf::PlanRepExpansion
position(edge e) constogdf::PlanRepExpansioninline
prepareNodeSplit(const SList< adjEntry > &partitionLeft, adjEntry &adjLeft, adjEntry &adjRight)ogdf::PlanRepExpansionprivate
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
removeEdgePath(edge eOrig, nodeSplit ns, node &oldSrc, node &oldTgt)ogdf::PlanRepExpansion
removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, nodeSplit ns, FaceSet< false > &newFaces, NodeSet< false > &mergedNodes, node &oldSrc, node &oldTgt)ogdf::PlanRepExpansion
removeSelfLoop(edge e, CombinatorialEmbedding &E)ogdf::PlanRepExpansion
removeSelfLoop(edge e)ogdf::PlanRepExpansion
representsCombEmbedding() constogdf::Graphinline
resetAdjEntryIndex(int newIndex, int oldIndex)ogdf::Graphprivate
resetEdgeIdCount(int maxId)ogdf::Graph
resetTableSizes()ogdf::Graphprivate
resolvePseudoCrossing(node v)ogdf::PlanRepExpansion
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
separateDummy(adjEntry adj_1, adjEntry adj_2, node vStraight, bool isSrc)ogdf::PlanRepExpansion
setOrigs(edge e, edge &eOrig, nodeSplit &ns)ogdf::PlanRepExpansion
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
split(edge e) overrideogdf::PlanRepExpansionvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
splitNodeSplit(edge e, CombinatorialEmbedding &E)ogdf::PlanRepExpansion
splitNodeSplit(edge e)ogdf::PlanRepExpansion
splittable(node v) constogdf::PlanRepExpansioninline
splittableOrig(node vOrig) constogdf::PlanRepExpansioninline
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(edge eIn, edge eOut) overrideogdf::PlanRepExpansionvirtual
ogdf::Graph::unsplit(node u)ogdf::Graph
unsplitExpandNode(node u, edge eContract, edge eExpand, CombinatorialEmbedding &E)ogdf::PlanRepExpansion
unsplitExpandNode(node u, edge eContract, edge eExpand)ogdf::PlanRepExpansion
~Graph()ogdf::Graphvirtual
~PlanRepExpansion()ogdf::PlanRepExpansioninline