Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::PlanRepInc Member List

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

activateEdge(edge e)ogdf::PlanRepInc
activateNode(node v)ogdf::PlanRepInc
adjEntry_iterator typedefogdf::Graph
adjEntryArrayTableSize() constogdf::Graphinline
alignUpward(adjEntry ae)ogdf::PlanRepUMLinline
alignUpward(adjEntry ae, bool b)ogdf::PlanRepUMLinline
allEdges(CONTAINER &edgeContainer) constogdf::Graphinline
allNodes(CONTAINER &nodeContainer) constogdf::Graphinline
assClassPattern() constogdf::PlanRepinlineprotected
assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)ogdf::Graphprotected
associationPattern() constogdf::PlanRepinlineprotected
boundaryAdj(node v) constogdf::PlanRepinline
boundaryAdj(node v)ogdf::PlanRepinline
brotherPattern() constogdf::PlanRepinlineprotected
ccInfo() constogdf::PlanRepinline
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
cleared() overrideogdf::PlanRepIncvirtual
cliquePattern() constogdf::PlanRepinlineprotected
collapse(NODELIST &nodesToCollapse)ogdf::Graphinline
collapseVertices(const OrthoRep &OR, Layout &drawing)ogdf::PlanRepUML
ogdf::PlanRep::collapseVertices(const OrthoRep &OR, GridLayout &drawing)ogdf::PlanRep
componentNumber(node v)ogdf::PlanRepIncinline
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::PlanRepinline
delEdge(edge e) overrideogdf::GraphCopyvirtual
deleteTreeConnection(int i, int j)ogdf::PlanRepInc
deleteTreeConnection(int i, int j, CombinatorialEmbedding &E)ogdf::PlanRepInc
delNode(node v) overrideogdf::GraphCopyvirtual
e(int i) constogdf::PlanRepinline
edge_iterator typedefogdf::Graph
edgeAdded(edge e) overrideogdf::PlanRepIncvirtual
edgeArrayTableSize() constogdf::Graphinline
edgeDeleted(edge e) overrideogdf::PlanRepIncvirtual
edgesogdf::Graph
EdgeType enum nameogdf::Graph
edgeTypeAND(edge e, edgeType et)ogdf::PlanRepinline
edgeTypeOf(edge e) constogdf::PlanRepinline
edgeTypeOR(edge e, edgeType et)ogdf::PlanRepinline
edgeTypePrimaryAND(edge e, edgeType et)ogdf::PlanRepinline
edgeTypePrimaryOR(edge e, edgeType et)ogdf::PlanRepinline
edgeTypes(edge e)ogdf::PlanRepinline
embed()ogdf::GraphCopy
empty() constogdf::Graphinline
expand(bool lowDegreeExpand=false) overrideogdf::PlanRepUMLvirtual
expandAdj(node v) constogdf::PlanRepinline
expandAdj(node v)ogdf::PlanRepinline
expandedNode(node v) constogdf::PlanRepinline
expandLowDegreeVertices(OrthoRep &OR, bool alignSmallDegree=false)ogdf::PlanRepUML
ogdf::PlanRep::expandLowDegreeVertices(OrthoRep &OR)ogdf::PlanRep
expansionPattern() constogdf::PlanRepinlineprotected
expansionType(edge e) constogdf::PlanRepinline
faceSplitter(edge e) constogdf::PlanRepUMLinline
firstEdge() constogdf::Graphinline
firstNode() constogdf::Graphinline
generalizationPattern() constogdf::PlanRepinlineprotected
genus() constogdf::Graph
getExtAdj(GraphCopy &GC, CombinatorialEmbedding &E)ogdf::PlanRepInc
getExtAdjs(List< adjEntry > &extAdjs)ogdf::PlanRepInc
getGraph() constogdf::GraphObserverinline
getGraphAttributes() constogdf::PlanRepinline
getUMLGraph() constogdf::PlanRepUMLinline
ogdf::Graph()ogdf::Graph
ogdf::Graph(const Graph &G)ogdf::Graph
GraphCopy(const Graph &G)ogdf::GraphCopyexplicit
GraphCopy()ogdf::GraphCopyinline
GraphCopy(const GraphCopy &GC)ogdf::GraphCopy
GraphObserver()ogdf::GraphObserverinline
GraphObserver(const Graph *G)ogdf::GraphObserverinlineexplicit
halfBrotherPattern() constogdf::PlanRepinlineprotected
hasAdjacentEdgesCrossings() constogdf::GraphCopy
hasNonSimpleCrossings() constogdf::GraphCopyinline
hasSameEdgesCrossings() constogdf::GraphCopy
heightOrig() constogdf::PlanRepinline
heightOrig(node v) constogdf::PlanRepinline
incrementalMergers(int indexCC) constogdf::PlanRepUMLinline
init(const Graph &G)ogdf::GraphCopy
initActiveCC(int i)ogdf::PlanRepInc
initActiveCCGen(int i, bool minNode)ogdf::PlanRepIncprotected
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 i)ogdf::PlanRepUML
initGC(const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy)ogdf::GraphCopyprivate
initMembers(const UMLGraph &UG)ogdf::PlanRepIncprotected
initMinActiveCC(int i)ogdf::PlanRepInc
insert(const Graph &G, NodeArray< node > &nodeMap)ogdf::Graph
insert(const Graph &G)ogdf::Graph
insertBoundary(node center, adjEntry &adjExternal)ogdf::PlanRep
insertCrossing(edge &crossingEdge, edge crossedEdge, bool topDown)ogdf::PlanRep
insertEdgePath(edge eOrig, const SList< adjEntry > &crossedEdges)ogdf::PlanRep
ogdf::GraphCopy::insertEdgePath(node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)ogdf::PlanRep
ogdf::GraphCopy::insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges)ogdf::GraphCopy
insertGenMerger(node v, const SList< edge > &inGens, CombinatorialEmbedding &E)ogdf::PlanRepUML
isAssClass(edge e) constogdf::PlanRepinline
isBoundary(edge e) constogdf::PlanRepinline
isBrother(edge e) constogdf::PlanRepinline
isCliqueBoundary(edge e) constogdf::PlanRepinline
isCrossingType(node v) constogdf::PlanRepinline
isDegreeExpansionEdge(edge e) constogdf::PlanRepinline
isDependency(edge e) constogdf::PlanRepinline
isDummy(node v) constogdf::GraphCopyinline
isDummy(edge e) constogdf::GraphCopyinline
isExpansion(edge e) constogdf::PlanRepinline
isExpansionEdge(edge e) constogdf::PlanRepinline
isGeneralization(edge e) constogdf::PlanRepinline
isHalfBrother(edge e) constogdf::PlanRepinline
isReversed(edge e) constogdf::GraphCopyinline
isReversedCopyEdge(edge e) constogdf::GraphCopy
isUserType(edge e, edgeType et) constogdf::PlanRepinline
isVertex(node v) constogdf::PlanRepinline
lastEdge() constogdf::Graphinline
lastNode() constogdf::Graphinline
m_activeNodesogdf::PlanRepIncprivate
m_alignUpwardogdf::PlanRepUMLprotected
m_boundaryAdjogdf::PlanRepprotected
m_ccInfoogdf::PlanRepprotected
m_componentogdf::PlanRepIncprivate
m_currentCCogdf::PlanRepprotected
m_eAuxCopyogdf::PlanRepprotected
m_eCopyogdf::GraphCopyprotected
m_edgeArrayTableSizeogdf::Graphprivate
m_edgeIdCountogdf::Graphprivate
m_edgeTypesogdf::PlanRepprotected
m_eIteratorogdf::GraphCopyprotected
m_eOrigogdf::GraphCopyprotected
m_eTreeArrayogdf::PlanRepIncprivate
m_eTypeogdf::PlanRepprotected
m_expandAdjogdf::PlanRepprotected
m_expandedNodeogdf::PlanRepprotected
m_expansionEdgeogdf::PlanRepprotected
m_faceSplitterogdf::PlanRepUMLprivate
m_hiddenEdgeSetsogdf::Graphprivate
m_incMergersogdf::PlanRepUMLprivate
m_itGListogdf::GraphObserverprotected
m_mergeEdgesogdf::PlanRepUMLprivate
m_mutexRegArraysogdf::Graphmutableprivate
m_nodeArrayTableSizeogdf::Graphprivate
m_nodeIdCountogdf::Graphprivate
m_nodeTypesogdf::PlanRepprotected
m_oriEdgeTypesogdf::PlanRepprotected
ogdf::m_pGraphogdf::GraphCopyprotected
ogdf::GraphObserver::m_pGraphogdf::GraphObserverprotected
m_pGraphAttributesogdf::PlanRepprotected
m_pUmlGraphogdf::PlanRepUMLprivate
m_regAdjArraysogdf::Graphmutableprivate
m_regEdgeArraysogdf::Graphmutableprivate
m_regNodeArraysogdf::Graphmutableprivate
m_regStructuresogdf::Graphmutableprivate
m_treeEdgeogdf::PlanRepIncprivate
m_treeInitogdf::PlanRepIncprivate
m_vCopyogdf::GraphCopyprotected
m_vOrigogdf::GraphCopyprotected
m_vTypeogdf::PlanRepprotected
makeTreeConnected(adjEntry adjExternal)ogdf::PlanRepInc
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
newCopy(node vOrig, Graph::NodeType vType)ogdf::PlanRep
newCopy(node v, adjEntry adjAfter, edge eOrig)ogdf::PlanRep
newCopy(node v, adjEntry adjAfter, edge eOrig, CombinatorialEmbedding &E)ogdf::PlanRep
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
nodeAdded(node v) overrideogdf::PlanRepIncvirtual
nodeArrayTableSize() constogdf::Graphinline
nodeDeleted(node v) overrideogdf::PlanRepIncvirtual
nodesogdf::Graph
NodeType enum nameogdf::Graph
nodeTypeOf(node v)ogdf::PlanRepinline
numberOfCCs() constogdf::PlanRepinline
numberOfEdges() constogdf::Graphinline
numberOfNodes() constogdf::Graphinline
numberOfNodesInCC() constogdf::PlanRepinline
numberOfNodesInCC(int cc) constogdf::PlanRepinline
operator=(const GraphCopy &GC)ogdf::GraphCopy
ogdf::Graph::operator=(const Graph &G)ogdf::Graph
oriEdgeTypes(edge e)ogdf::PlanRepinline
original() constogdf::GraphCopyinline
original(node v) constogdf::GraphCopyinline
original(edge e) constogdf::GraphCopyinline
original(adjEntry adj) constogdf::GraphCopyinline
PlanRep(const Graph &G)ogdf::PlanRepexplicit
PlanRep(const GraphAttributes &AG)ogdf::PlanRepexplicit
PlanRepInc(const UMLGraph &UG)ogdf::PlanRepIncexplicit
PlanRepInc(const UMLGraph &UG, const NodeArray< bool > &fixed)ogdf::PlanRepInc
PlanRepUML(const UMLGraph &umlGraph)ogdf::PlanRepUMLexplicit
PlanRepUML(const GraphAttributes &GA)ogdf::PlanRepUMLexplicit
prepareIncrementalMergers(int indexCC, CombinatorialEmbedding &E)ogdf::PlanRepUMLprotected
pureNewNode()ogdf::Graphprivate
registerArray(NodeArrayBase *pNodeArray) constogdf::Graph
registerArray(EdgeArrayBase *pEdgeArray) constogdf::Graph
registerArray(AdjEntryArrayBase *pAdjArray) constogdf::Graph
registerStructure(GraphObserver *pStructure) constogdf::Graph
reInit() overrideogdf::PlanRepIncvirtual
reinitArrays(bool doResetTableSizes=true)ogdf::Graphprivate
reinitStructures()ogdf::Graphprivate
removeAdjacentEdgesCrossing(adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph)ogdf::GraphCopyprotected
removeCrossing(node v)ogdf::PlanRep
removeDeg1Nodes(ArrayBuffer< Deg1RestoreInfo > &S, const NodeArray< bool > &mark)ogdf::PlanRep
removeEdgePath(edge eOrig)ogdf::GraphCopy
removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)ogdf::PlanRepinline
ogdf::GraphCopy::removeEdgePathEmbedded(CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig)ogdf::GraphCopy
removeFaceSplitter()ogdf::PlanRepUMLinline
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
reregister(const Graph *pG)ogdf::GraphObserverinline
resetAdjEntryIndex(int newIndex, int oldIndex)ogdf::Graphprivate
resetEdgeIdCount(int maxId)ogdf::Graph
resetTableSizes()ogdf::Graphprivate
restoreAllEdges()ogdf::Graphprivate
restoreDeg1Nodes(ArrayBuffer< Deg1RestoreInfo > &S, List< node > &deg1s)ogdf::PlanRep
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
setAssClass(edge e)ogdf::PlanRepinline
setAssociation(edge e)ogdf::PlanRepinline
setBrother(edge e)ogdf::PlanRepinline
setCliqueBoundary(edge e)ogdf::PlanRepinline
setCopyType(edge eCopy, edge eOrig)ogdf::PlanRepprotected
setCrossingType(node v)ogdf::PlanRepinline
setDependency(edge e)ogdf::PlanRepinline
setEdge(edge eOrig, edge eCopy)ogdf::GraphCopy
setEdgeTypeOf(edge e, edgeType et)ogdf::PlanRepinline
setExpandedNode(node v, node w)ogdf::PlanRepinline
setExpansion(edge e)ogdf::PlanRepinline
setExpansionEdge(edge e, int expType)ogdf::PlanRepinline
setGeneralization(edge e)ogdf::PlanRepinline
setHalfBrother(edge e)ogdf::PlanRepinline
setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2)ogdf::GraphCopyprotected
setOriginalEmbedding()ogdf::GraphCopy
setPrimaryType(edge e, edgeType et)ogdf::PlanRepinline
setPrimaryType(edge e, UMLEdgeTypeConstants et)ogdf::PlanRepinline
setSecondaryType(edge e, edgeType et)ogdf::PlanRepinline
setType(edge e, EdgeType et)ogdf::PlanRepinline
setupIncremental(int indexCC, CombinatorialEmbedding &E)ogdf::PlanRepUML
setUserType(edge e, edgeType et)ogdf::PlanRepinline
sort(node v, const ADJ_ENTRY_LIST &newOrder)ogdf::Graphinline
split(edge e) overrideogdf::PlanRepIncinlinevirtual
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight)ogdf::Graph
startEdge() constogdf::PlanRepinline
startNode() constogdf::PlanRepinline
startNode(int cc) constogdf::PlanRepinline
stopEdge() constogdf::PlanRepinline
stopNode() constogdf::PlanRepinline
stopNode(int cc) constogdf::PlanRepinline
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
treeEdge(edge e)ogdf::PlanRepIncinline
treeEdge(int i, int j) constogdf::PlanRepIncinline
treeInit()ogdf::PlanRepIncinline
typeOf(node v) constogdf::PlanRepinline
typeOf(node v)ogdf::PlanRepinline
typeOf(edge e) constogdf::PlanRepinline
typeOf(edge e)ogdf::PlanRepinline
typeOrig(edge e) constogdf::PlanRepinline
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::PlanRepinline
widthOrig() constogdf::PlanRepinline
widthOrig(node v) constogdf::PlanRepinline
writeGML(const char *fileName, const Layout &drawing)ogdf::PlanRepUML
writeGML(const char *fileName)ogdf::PlanRepUML
writeGML(const char *fileName, GraphAttributes &AG)ogdf::PlanRepUML
writeGML(std::ostream &os, const Layout &drawing)ogdf::PlanRepUML
writeGML(const char *fileName, const OrthoRep &OR, const Layout &drawing)ogdf::PlanRepUML
writeGML(std::ostream &os, const OrthoRep &OR, const Layout &drawing)ogdf::PlanRepUML
writeGML(const char *fileName, const OrthoRep &OR, const GridLayoutMapped &drawing)ogdf::PlanRepUML
writeGML(std::ostream &os, const OrthoRep &OR, const GridLayoutMapped &drawing)ogdf::PlanRepUML
ogdf::PlanRep::writeGML(const char *fileName, const OrthoRep &OR, const GridLayout &drawing)ogdf::PlanRep
ogdf::PlanRep::writeGML(std::ostream &os, const OrthoRep &OR, const GridLayout &drawing)ogdf::PlanRep
~Graph()ogdf::Graphvirtual
~GraphCopy()ogdf::GraphCopyinlinevirtual
~GraphObserver()ogdf::GraphObserverinlinevirtual
~PlanRep()ogdf::PlanRepinlinevirtual
~PlanRepUML()ogdf::PlanRepUMLinline