This is the complete list of members for ogdf::PlanRepUML, including all inherited members.
adjEntry_iterator typedef | ogdf::Graph | |
adjEntryRegistry() | ogdf::Graph | inline |
adjEntryRegistry() const | ogdf::Graph | inline |
alignUpward(adjEntry ae) | ogdf::PlanRepUML | inline |
alignUpward(adjEntry ae, bool b) | ogdf::PlanRepUML | inline |
allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
assClassPattern() const | ogdf::PlanRep | inlineprotected |
associationPattern() const | ogdf::PlanRep | inlineprotected |
boundaryAdj(node v) const | ogdf::PlanRep | inline |
boundaryAdj(node v) | ogdf::PlanRep | inline |
brotherPattern() const | ogdf::PlanRep | inlineprotected |
ccInfo() const | ogdf::PlanRep | inline |
chain(edge e) const | ogdf::GraphCopy | 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() override | ogdf::GraphCopy | virtual |
clearObservers() | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
cliquePattern() const | ogdf::PlanRep | inlineprotected |
collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
collapseVertices(const OrthoRep &OR, Layout &drawing) | ogdf::PlanRepUML | |
ogdf::PlanRep::collapseVertices(const OrthoRep &OR, GridLayout &drawing) | ogdf::PlanRep | |
consistencyCheck() const | ogdf::GraphCopy | |
contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
copy(edge e) const override | ogdf::GraphCopy | inlinevirtual |
copy(adjEntry adj) const override | ogdf::GraphCopy | inlinevirtual |
copy(node v) const | ogdf::GraphCopy | inline |
copy(edge e) const=0 | ogdf::GraphCopy | |
copy(adjEntry adj) const=0 | ogdf::GraphCopy | |
ogdf::GraphCopyBase::copy(node v) const | ogdf::GraphCopyBase | inline |
createEmpty(const Graph &G) | ogdf::GraphCopyBase | inline |
currentCC() const | ogdf::PlanRep | inline |
delEdge(edge e) override | ogdf::GraphCopy | virtual |
delNode(node v) override | ogdf::GraphCopyBase | inlinevirtual |
e(int i) const | ogdf::PlanRep | inline |
edge_iterator typedef | ogdf::Graph | |
edgeInserted(void *userData, edge original, edge copy) override | ogdf::GraphCopy | protectedvirtual |
edgeRegistry() | ogdf::Graph | inline |
edgeRegistry() const | ogdf::Graph | inline |
edges | ogdf::Graph | |
EdgeType enum name | ogdf::Graph | |
edgeTypeAND(edge e, edgeType et) | ogdf::PlanRep | inline |
edgeTypeOf(edge e) const | ogdf::PlanRep | inline |
edgeTypeOR(edge e, edgeType et) | ogdf::PlanRep | inline |
edgeTypePrimaryAND(edge e, edgeType et) | ogdf::PlanRep | inline |
edgeTypePrimaryOR(edge e, edgeType et) | ogdf::PlanRep | inline |
edgeTypes(edge e) | ogdf::PlanRep | inline |
empty() const | ogdf::Graph | inline |
expand(bool lowDegreeExpand=false) override | ogdf::PlanRepUML | virtual |
expandAdj(node v) const | ogdf::PlanRep | inline |
expandAdj(node v) | ogdf::PlanRep | inline |
expandedNode(node v) const | ogdf::PlanRep | inline |
expandLowDegreeVertices(OrthoRep &OR, bool alignSmallDegree=false) | ogdf::PlanRepUML | |
ogdf::PlanRep::expandLowDegreeVertices(OrthoRep &OR) | ogdf::PlanRep | |
expansionPattern() const | ogdf::PlanRep | inlineprotected |
expansionType(edge e) const | ogdf::PlanRep | inline |
faceSplitter(edge e) const | ogdf::PlanRepUML | inline |
firstEdge() const | ogdf::Graph | inline |
firstNode() const | ogdf::Graph | inline |
generalizationPattern() const | ogdf::PlanRep | inlineprotected |
genus() const | ogdf::Graph | |
getGraphAttributes() const | ogdf::PlanRep | inline |
getLinkCopiesOnInsert() const | ogdf::GraphCopyBase | inline |
getObservers() const | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
getOriginalGraph() const | ogdf::GraphCopyBase | inline |
getUMLGraph() const | ogdf::PlanRepUML | inline |
Graph() | ogdf::Graph | |
Graph(const Graph ©) | ogdf::Graph | |
Graph(Graph &&move)=delete | ogdf::Graph | |
GraphCopy() | ogdf::GraphCopy | inlineexplicit |
GraphCopy(const Graph &G) | ogdf::GraphCopy | inlineexplicit |
GraphCopy(const Graph *G) | ogdf::GraphCopy | inlineexplicit |
GraphCopy(const GraphCopy &other) | ogdf::GraphCopy | inline |
GraphCopyBase()=default | ogdf::GraphCopyBase | |
GraphCopyBase(const GraphCopyBase &other)=delete | ogdf::GraphCopyBase | |
GraphCopyBase(GraphCopyBase &&other) noexcept=delete | ogdf::GraphCopyBase | |
halfBrotherPattern() const | ogdf::PlanRep | inlineprotected |
hasAdjacentEdgesCrossings() const | ogdf::GraphCopy | |
hasNonSimpleCrossings() const | ogdf::GraphCopy | inline |
hasSameEdgesCrossings() const | ogdf::GraphCopy | |
heightOrig() const | ogdf::PlanRep | inline |
heightOrig(node v) const | ogdf::PlanRep | inline |
incrementalMergers(int indexCC) const | ogdf::PlanRepUML | inline |
init(const Graph &G) | ogdf::GraphCopyBase | inline |
init(const Graph *G) | ogdf::GraphCopyBase | inline |
initCC(int i) | ogdf::PlanRepUML | |
insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EdgeSet< true > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EdgeSet< false > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
insert(const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
insert(const Graph &G) | ogdf::Graph | inline |
insertAdjEntry(adjEntry oldAdj, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
insertAdjEntry(node n, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
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 | |
insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData) | ogdf::Graph | private |
isAssClass(edge e) const | ogdf::PlanRep | inline |
isBoundary(edge e) const | ogdf::PlanRep | inline |
isBrother(edge e) const | ogdf::PlanRep | inline |
isCliqueBoundary(edge e) const | ogdf::PlanRep | inline |
isCrossingType(node v) const | ogdf::PlanRep | inline |
isDegreeExpansionEdge(edge e) const | ogdf::PlanRep | inline |
isDependency(edge e) const | ogdf::PlanRep | inline |
isDummy(node v) const | ogdf::GraphCopyBase | inline |
isDummy(edge e) const | ogdf::GraphCopyBase | inline |
isDummy(adjEntry adj) const | ogdf::GraphCopyBase | inline |
isExpansion(edge e) const | ogdf::PlanRep | inline |
isExpansionEdge(edge e) const | ogdf::PlanRep | inline |
isGeneralization(edge e) const | ogdf::PlanRep | inline |
isHalfBrother(edge e) const | ogdf::PlanRep | inline |
isReversed(edge e) const | ogdf::GraphCopy | inline |
isReversedCopyEdge(edge e) const | ogdf::GraphCopy | |
isUserType(edge e, edgeType et) const | ogdf::PlanRep | inline |
isVertex(node v) const | ogdf::PlanRep | inline |
lastEdge() const | ogdf::Graph | inline |
lastNode() const | ogdf::Graph | inline |
m_alignUpward | ogdf::PlanRepUML | protected |
m_boundaryAdj | ogdf::PlanRep | protected |
m_ccInfo | ogdf::PlanRep | protected |
m_currentCC | ogdf::PlanRep | protected |
m_eAuxCopy | ogdf::PlanRep | protected |
m_eCopy | ogdf::GraphCopy | protected |
m_edgeIdCount | ogdf::Graph | private |
m_edgeTypes | ogdf::PlanRep | protected |
m_eIterator | ogdf::GraphCopy | protected |
m_eOrig | ogdf::GraphCopyBase | protected |
m_eType | ogdf::PlanRep | protected |
m_expandAdj | ogdf::PlanRep | protected |
m_expandedNode | ogdf::PlanRep | protected |
m_expansionEdge | ogdf::PlanRep | protected |
m_faceSplitter | ogdf::PlanRepUML | private |
m_hiddenEdgeSets | ogdf::Graph | private |
m_incMergers | ogdf::PlanRepUML | private |
m_linkCopiesOnInsert | ogdf::GraphCopyBase | protected |
m_mergeEdges | ogdf::PlanRepUML | private |
m_mutexRegArrays | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
m_nodeIdCount | ogdf::Graph | private |
m_nodeTypes | ogdf::PlanRep | protected |
m_oriEdgeTypes | ogdf::PlanRep | protected |
m_pGraph | ogdf::GraphCopyBase | protected |
m_pGraphAttributes | ogdf::PlanRep | protected |
m_pUmlGraph | ogdf::PlanRepUML | private |
m_regAdjArrays | ogdf::Graph | private |
m_regEdgeArrays | ogdf::Graph | private |
m_regNodeArrays | ogdf::Graph | private |
m_regObservers | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
m_vCopy | ogdf::GraphCopyBase | protected |
m_vOrig | ogdf::GraphCopyBase | protected |
m_vType | ogdf::PlanRep | protected |
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 |
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, int index=-1) | ogdf::GraphCopy | inline |
newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::GraphCopy | inline |
newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::GraphCopy | inline |
newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::GraphCopy | inline |
newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::GraphCopy | inline |
ogdf::GraphCopyBase::newEdge(node v, node w, int index=-1) | ogdf::Graph | inline |
ogdf::GraphCopyBase::newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::Graph | inline |
ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::Graph | inline |
ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::Graph | inline |
ogdf::GraphCopyBase::newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::Graph | inline |
newNode(node vOrig) | ogdf::GraphCopyBase | inline |
newNode(int index=-1) | ogdf::GraphCopyBase | inline |
ogdf::Graph::newNode(int index=-1) | ogdf::Graph | inline |
node_iterator typedef | ogdf::Graph | |
nodeInserted(void *userData, node original, node copy) override | ogdf::GraphCopyBase | protectedvirtual |
nodeRegistry() | ogdf::Graph | inline |
nodeRegistry() const | ogdf::Graph | inline |
nodes | ogdf::Graph | |
NodeType enum name | ogdf::Graph | |
nodeTypeOf(node v) | ogdf::PlanRep | inline |
numberOfCCs() const | ogdf::PlanRep | inline |
numberOfEdges() const | ogdf::Graph | inline |
numberOfNodes() const | ogdf::Graph | inline |
numberOfNodesInCC() const | ogdf::PlanRep | inline |
numberOfNodesInCC(int cc) const | ogdf::PlanRep | inline |
Observable()=default | ogdf::Observable< GraphObserver, Graph > | |
Observable(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observable(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observer< TObserved, TObserver > | ogdf::Observable< GraphObserver, Graph > | private |
operator const internal::GraphAdjRegistry &() const | ogdf::Graph | inline |
operator const internal::GraphEdgeRegistry &() const | ogdf::Graph | inline |
operator const internal::GraphNodeRegistry &() const | ogdf::Graph | inline |
operator=(const GraphCopy &other) | ogdf::GraphCopy | |
ogdf::GraphCopyBase::operator=(const GraphCopyBase &other)=delete | ogdf::GraphCopyBase | |
ogdf::GraphCopyBase::operator=(GraphCopyBase &&other) noexcept=delete | ogdf::GraphCopyBase | |
ogdf::Graph::operator=(const Graph ©) | ogdf::Graph | |
ogdf::Graph::operator=(Graph &&move)=delete | ogdf::Graph | |
Observable< GraphObserver, Graph >::operator=(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
Observable< GraphObserver, Graph >::operator=(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
oriEdgeTypes(edge e) | ogdf::PlanRep | inline |
original() const | ogdf::GraphCopyBase | inline |
original(node v) const | ogdf::GraphCopyBase | inline |
original(edge e) const | ogdf::GraphCopyBase | inline |
original(adjEntry adj) const | ogdf::GraphCopyBase | inline |
PlanRep(const Graph &G) | ogdf::PlanRep | explicit |
PlanRep(const GraphAttributes &AG) | ogdf::PlanRep | explicit |
PlanRepUML(const UMLGraph ¨Graph) | ogdf::PlanRepUML | explicit |
PlanRepUML(const GraphAttributes &GA) | ogdf::PlanRepUML | explicit |
postInsert(void *userData, int newNodes, int newEdges) | ogdf::Graph | inlineprotectedvirtual |
preInsert(bool copyEmbedding, bool copyIDs, bool notifyObservers, bool edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap, int *newNodes, int *newEdges) override | ogdf::GraphCopyBase | protectedvirtual |
prepareIncrementalMergers(int indexCC, CombinatorialEmbedding &E) | ogdf::PlanRepUML | protected |
pureNewEdge(node src, node tgt, int index) | ogdf::Graph | inlineprivate |
pureNewNode(int index) | ogdf::Graph | inlineprivate |
registerObserver(GraphObserver *obs) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
removeAdjacentEdgesCrossing(adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
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::PlanRep | inline |
ogdf::GraphCopy::removeEdgePathEmbedded(CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig) | ogdf::GraphCopy | |
removeFaceSplitter() | ogdf::PlanRepUML | inline |
removeNonSimpleCrossings(SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | |
removeNonSimpleCrossings(DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | inline |
removeNonSimpleCrossings(node origNode, DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | inline |
removePseudoCrossings() | ogdf::GraphCopy | |
removeSameEdgesCrossing(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
removeUnnecessaryCrossing(adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2) | ogdf::GraphCopy | protected |
removeUnnecessaryCrossing(adjEntry adj, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
representsCombEmbedding() const | ogdf::Graph | inline |
resetEdgeIdCount(int maxId) | ogdf::Graph | |
resetNodeIdCount(int maxId) | ogdf::Graph | |
restoreAllEdges() | ogdf::Graph | |
restoreDeg1Nodes(ArrayBuffer< Deg1RestoreInfo > &S, List< node > °1s) | ogdf::PlanRep | |
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 | |
setAssClass(edge e) | ogdf::PlanRep | inline |
setAssociation(edge e) | ogdf::PlanRep | inline |
setBrother(edge e) | ogdf::PlanRep | inline |
setCliqueBoundary(edge e) | ogdf::PlanRep | inline |
setCopyType(edge eCopy, edge eOrig) | ogdf::PlanRep | protected |
setCrossingType(node v) | ogdf::PlanRep | inline |
setDependency(edge e) | ogdf::PlanRep | inline |
setEdge(edge eOrig, edge eCopy) | ogdf::GraphCopy | |
setEdgeTypeOf(edge e, edgeType et) | ogdf::PlanRep | inline |
setExpandedNode(node v, node w) | ogdf::PlanRep | inline |
setExpansion(edge e) | ogdf::PlanRep | inline |
setExpansionEdge(edge e, int expType) | ogdf::PlanRep | inline |
setGeneralization(edge e) | ogdf::PlanRep | inline |
setHalfBrother(edge e) | ogdf::PlanRep | inline |
setLinkCopiesOnInsert(bool linkCopiesOnInsert) | ogdf::GraphCopyBase | inline |
setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2) | ogdf::GraphCopy | protected |
setOriginalEmbedding() override | ogdf::GraphCopy | virtual |
setOriginalGraph(const Graph *G) override | ogdf::GraphCopy | virtual |
setOriginalGraph(const Graph *G)=0 | ogdf::GraphCopy | |
setOriginalGraph(const Graph &G) | ogdf::GraphCopy | inline |
ogdf::GraphCopyBase::setOriginalGraph(const Graph &G) | ogdf::GraphCopyBase | inline |
setPrimaryType(edge e, edgeType et) | ogdf::PlanRep | inline |
setPrimaryType(edge e, UMLEdgeTypeConstants et) | ogdf::PlanRep | inline |
setSecondaryType(edge e, edgeType et) | ogdf::PlanRep | inline |
setType(edge e, EdgeType et) | ogdf::PlanRep | inline |
setupIncremental(int indexCC, CombinatorialEmbedding &E) | ogdf::PlanRepUML | |
setUserType(edge e, edgeType et) | ogdf::PlanRep | inline |
sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
sort(node v, IT begin, IT end) | ogdf::Graph | inline |
split(edge e) override | ogdf::PlanRepUML | inlinevirtual |
splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
startEdge() const | ogdf::PlanRep | inline |
startNode() const | ogdf::PlanRep | inline |
startNode(int cc) const | ogdf::PlanRep | inline |
stopEdge() const | ogdf::PlanRep | inline |
stopNode() const | ogdf::PlanRep | inline |
stopNode(int cc) const | ogdf::PlanRep | inline |
swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
swapOriginalEdgesAtCrossing(adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr) | ogdf::GraphCopy | protected |
swapOriginalEdgesBetweenCrossings(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr) | ogdf::GraphCopy | protected |
typeOf(node v) const | ogdf::PlanRep | inline |
typeOf(node v) | ogdf::PlanRep | inline |
typeOf(edge e) const | ogdf::PlanRep | inline |
typeOf(edge e) | ogdf::PlanRep | inline |
typeOrig(edge e) const | ogdf::PlanRep | inline |
unregisterObserver(typename ListPure< GraphObserver * >::iterator it) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
unsplit(edge eIn, edge eOut) override | ogdf::GraphCopy | virtual |
ogdf::GraphCopyBase::unsplit(node u) | ogdf::Graph | |
v(int i) const | ogdf::PlanRep | inline |
widthOrig() const | ogdf::PlanRep | inline |
widthOrig(node v) const | ogdf::PlanRep | inline |
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::Graph | virtual |
~Observable() | ogdf::Observable< GraphObserver, Graph > | inlinevirtual |
~PlanRep() | ogdf::PlanRep | inlinevirtual |
~PlanRepUML() | ogdf::PlanRepUML | inline |