Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::PlanRepLight Member List

This is the complete list of members for ogdf::PlanRepLight, 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
ccInfo() constogdf::PlanRepLightinline
chain(edge e) constogdf::GraphCopyinline
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() overrideogdf::GraphCopyvirtual
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::GraphCopyinline
copy(edge e) constogdf::GraphCopyinline
copy(adjEntry adj) constogdf::GraphCopyinline
createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt)ogdf::Graphprivate
createEmpty(const Graph &G)ogdf::GraphCopy
currentCC() constogdf::PlanRepLightinline
delEdge(edge e) overrideogdf::GraphCopyvirtual
delNode(node v) overrideogdf::GraphCopyvirtual
e(int i) constogdf::PlanRepLightinline
edge_iterator typedefogdf::Graph
edgeArrayTableSize() constogdf::Graphinline
edgesogdf::Graph
EdgeType enum nameogdf::Graph
embed()ogdf::GraphCopy
empty() constogdf::Graphinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
genus() constogdf::Graph
Graph()ogdf::Graph
Graph(const Graph &G)ogdf::Graph
GraphCopy(const Graph &G)ogdf::GraphCopyexplicit
GraphCopy()ogdf::GraphCopyinline
GraphCopy(const GraphCopy &GC)ogdf::GraphCopy
hasAdjacentEdgesCrossings() constogdf::GraphCopy
hasNonSimpleCrossings() constogdf::GraphCopyinline
hasSameEdgesCrossings() constogdf::GraphCopy
init(const Graph &G)ogdf::GraphCopy
initByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy)ogdf::GraphCopy
initByCC(const CCsInfo &info, int cc, EdgeArray< edge > &eCopy)ogdf::GraphCopy
initByNodes(const List< node > &origNodes, EdgeArray< edge > &eCopy)ogdf::GraphCopy
initCC(int cc)ogdf::PlanRepLight
initGC(const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy)ogdf::GraphCopyprivate
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
insertCrossing(edge &crossingEdge, edge crossedEdge, bool rightToLeft)ogdf::GraphCopy
insertEdgePath(edge eOrig, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePath(node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
isDummy(node v) constogdf::GraphCopyinline
isDummy(edge e) constogdf::GraphCopyinline
isReversed(edge e) constogdf::GraphCopyinline
isReversedCopyEdge(edge e) constogdf::GraphCopy
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_ccInfoogdf::PlanRepLightprivate
m_currentCCogdf::PlanRepLightprivate
m_eAuxCopyogdf::PlanRepLightprivate
m_eCopyogdf::GraphCopyprotected
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_eIteratorogdf::GraphCopyprotected
m_eOrigogdf::GraphCopyprotected
m_hiddenEdgeSetsogdf::Graphprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_pGraphogdf::GraphCopyprotected
m_progdf::PlanRepLightprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_vCopyogdf::GraphCopyprotected
m_vOrigogdf::GraphCopyprotected
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::GraphCopy
newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E)ogdf::GraphCopy
newEdge(node v, node w)ogdf::GraphCopy
newEdge(node v, node w, int index)ogdf::GraphCopy
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)ogdf::GraphCopy
newEdge(node v, adjEntry adjTgt)ogdf::GraphCopy
newEdge(adjEntry adjSrc, node w)ogdf::GraphCopy
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::GraphCopyinline
newNode()ogdf::GraphCopy
newNode(int index)ogdf::GraphCopy
ogdf::Graph::newNode(int index)ogdf::Graph
node_iterator typedefogdf::Graph
nodeArrayTableSize() constogdf::Graphinline
nodesogdf::Graph
NodeType enum nameogdf::Graph
numberOfCCs() constogdf::PlanRepLightinline
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
operator=(const GraphCopy &GC)ogdf::GraphCopy
ogdf::Graph::operator=(const Graph &G)ogdf::Graph
original() constogdf::GraphCopyinline
original(node v) constogdf::GraphCopyinline
original(edge e) constogdf::GraphCopyinline
original(adjEntry adj) constogdf::GraphCopyinline
PlanRepLight(const PlanRep &pr)ogdf::PlanRepLight
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
removeAdjacentEdgesCrossing(adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
removeEdgePath(edge eOrig)ogdf::GraphCopy
removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)ogdf::GraphCopy
removeEdgePathEmbedded(CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig)ogdf::GraphCopy
removeNonSimpleCrossings(SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopy
removeNonSimpleCrossings(DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopyinline
removeNonSimpleCrossings(node origNode, DynamicDualGraph *dualGraph=nullptr)ogdf::GraphCopyinline
removePseudoCrossings()ogdf::GraphCopy
removeSameEdgesCrossing(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
removeUnnecessaryCrossing(adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)ogdf::GraphCopyprotected
removeUnnecessaryCrossing(adjEntry adj, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
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
setEdge(edge eOrig, edge eCopy)ogdf::GraphCopy
setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2)ogdf::GraphCopyprotected
setOriginalEmbedding()ogdf::GraphCopy
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
split(edge e) overrideogdf::GraphCopyvirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
startEdge() constogdf::PlanRepLightinline
stopEdge() constogdf::PlanRepLightinline
swapAdjEdges(adjEntry adj1, adjEntry adj2)ogdf::Graphinline
swapOriginalEdgesAtCrossing(adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr)ogdf::GraphCopyprotected
swapOriginalEdgesBetweenCrossings(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr)ogdf::GraphCopyprotected
typeOf(edge e) constogdf::PlanRepLightinline
typeOrig(edge eOrig) constogdf::PlanRepLightinline
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::GraphCopyvirtual
ogdf::Graph::unsplit(node u)ogdf::Graph
v(int i) constogdf::PlanRepLightinline
~Graph()ogdf::Graphvirtual
~GraphCopy()ogdf::GraphCopyinlinevirtual