| adjEntry_iterator typedef | ogdf::Graph | |
| adjEntryArrayTableSize() const | ogdf::Graph | inline |
| allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
| allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
| assClassPattern() const | ogdf::PlanRep | inlineprotected |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| 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 |
| cliquePattern() const | ogdf::PlanRep | inlineprotected |
| ClusterID(node v) const | ogdf::ClusterPlanRep | inline |
| ClusterID(edge e) const | ogdf::ClusterPlanRep | inline |
| clusterOfDummy(node v) | ogdf::ClusterPlanRep | inline |
| clusterOfEdge(edge e) | ogdf::ClusterPlanRep | inline |
| clusterOfIndex(int i) | ogdf::ClusterPlanRep | inline |
| clusterPattern() | ogdf::ClusterPlanRep | inlineprivate |
| ClusterPlanRep(const ClusterGraphAttributes &acGraph, const ClusterGraph &clusterGraph) | ogdf::ClusterPlanRep | |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
| collapseVertices(const OrthoRep &OR, Layout &drawing) | ogdf::PlanRep | |
| collapseVertices(const OrthoRep &OR, GridLayout &drawing) | ogdf::PlanRep | |
| construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByCC(const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByNodes(const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
| convertClusterGraph(cluster act, AdjEntryArray< edge > ¤tEdge, AdjEntryArray< int > &outEdge) | ogdf::ClusterPlanRep | protected |
| copy(node v) const | ogdf::GraphCopy | inline |
| copy(edge e) const | ogdf::GraphCopy | inline |
| copy(adjEntry adj) const | ogdf::GraphCopy | inline |
| createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) | ogdf::Graph | private |
| createEmpty(const Graph &G) | ogdf::GraphCopy | |
| currentCC() const | ogdf::PlanRep | inline |
| delEdge(edge e) override | ogdf::GraphCopy | virtual |
| delNode(node v) override | ogdf::GraphCopy | virtual |
| e(int i) const | ogdf::PlanRep | inline |
| edge_iterator typedef | ogdf::Graph | |
| edgeArrayTableSize() 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 |
| embed() | ogdf::GraphCopy | |
| empty() const | ogdf::Graph | inline |
| expand(bool lowDegreeExpand=false) override | ogdf::ClusterPlanRep | virtual |
| expandAdj(node v) const | ogdf::PlanRep | inline |
| expandAdj(node v) | ogdf::PlanRep | inline |
| expandedNode(node v) const | ogdf::PlanRep | inline |
| expandLowDegreeVertices(OrthoRep &OR) | ogdf::ClusterPlanRep | virtual |
| expansionPattern() const | ogdf::PlanRep | inlineprotected |
| expansionType(edge e) const | ogdf::PlanRep | inline |
| externalAdj() | ogdf::ClusterPlanRep | inline |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| generalizationPattern() const | ogdf::PlanRep | inlineprotected |
| genus() const | ogdf::Graph | |
| getClusterGraph() const | ogdf::ClusterPlanRep | inline |
| getGraphAttributes() const | ogdf::PlanRep | inline |
| Graph() | ogdf::Graph | |
| Graph(const Graph &G) | ogdf::Graph | |
| GraphCopy(const Graph &G) | ogdf::GraphCopy | explicit |
| GraphCopy() | ogdf::GraphCopy | inline |
| GraphCopy(const GraphCopy &GC) | ogdf::GraphCopy | |
| 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 |
| 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 i) | ogdf::ClusterPlanRep | |
| initGC(const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | private |
| insert(const Graph &G, NodeArray< node > &nodeMap) | ogdf::Graph | |
| insert(const Graph &G) | ogdf::Graph | |
| insertBoundary(cluster C, AdjEntryArray< edge > ¤tEdge, AdjEntryArray< int > &outEdge, bool clusterIsLeaf) | ogdf::ClusterPlanRep | protected |
| ogdf::PlanRep::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::ClusterPlanRep | |
| ogdf::GraphCopy::insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| 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 |
| isClusterBoundary(edge e) | ogdf::ClusterPlanRep | 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::GraphCopy | inline |
| isDummy(edge e) const | ogdf::GraphCopy | 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_boundaryAdj | ogdf::PlanRep | protected |
| m_ccInfo | ogdf::PlanRep | protected |
| m_clusterOfIndex | ogdf::ClusterPlanRep | private |
| m_currentCC | ogdf::PlanRep | protected |
| m_eAuxCopy | ogdf::PlanRep | protected |
| m_eCopy | ogdf::GraphCopy | protected |
| m_edgeArrayTableSize | ogdf::Graph | private |
| m_edgeClusterID | ogdf::ClusterPlanRep | private |
| m_edgeIdCount | ogdf::Graph | private |
| m_edgeTypes | ogdf::PlanRep | protected |
| m_eIterator | ogdf::GraphCopy | protected |
| m_eOrig | ogdf::GraphCopy | protected |
| m_eType | ogdf::PlanRep | protected |
| m_expandAdj | ogdf::PlanRep | protected |
| m_expandedNode | ogdf::PlanRep | protected |
| m_expansionEdge | ogdf::PlanRep | protected |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_mutexRegArrays | ogdf::Graph | mutableprivate |
| m_nodeArrayTableSize | ogdf::Graph | private |
| m_nodeClusterID | ogdf::ClusterPlanRep | private |
| m_nodeIdCount | ogdf::Graph | private |
| m_nodeTypes | ogdf::PlanRep | protected |
| m_oriEdgeTypes | ogdf::PlanRep | protected |
| m_pClusterGraph | ogdf::ClusterPlanRep | private |
| m_pGraph | ogdf::GraphCopy | protected |
| m_pGraphAttributes | ogdf::PlanRep | protected |
| m_regAdjArrays | ogdf::Graph | mutableprivate |
| m_regEdgeArrays | ogdf::Graph | mutableprivate |
| m_regNodeArrays | ogdf::Graph | mutableprivate |
| m_regStructures | ogdf::Graph | mutableprivate |
| m_rootAdj | ogdf::ClusterPlanRep | private |
| m_vCopy | ogdf::GraphCopy | protected |
| m_vOrig | ogdf::GraphCopy | protected |
| m_vType | ogdf::PlanRep | protected |
| maxAdjEntryIndex() const | ogdf::Graph | inline |
| maxEdgeIndex() const | ogdf::Graph | inline |
| maxNodeIndex() const | ogdf::Graph | inline |
| ModelBoundaries() | ogdf::ClusterPlanRep | |
| 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 |
| moveRegisterArray(ListIterator< ArrayBase * > it, ArrayBase *pArray) const | 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) | 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 | |
| newNode(node vOrig) | ogdf::GraphCopy | inline |
| newNode() | ogdf::GraphCopy | |
| newNode(int index) | ogdf::GraphCopy | |
| node_iterator typedef | ogdf::Graph | |
| nodeArrayTableSize() 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 |
| operator=(const GraphCopy &GC) | ogdf::GraphCopy | |
| ogdf::Graph::operator=(const Graph &G) | ogdf::Graph | |
| oriEdgeTypes(edge e) | ogdf::PlanRep | inline |
| original() const | ogdf::GraphCopy | inline |
| original(node v) const | ogdf::GraphCopy | inline |
| original(edge e) const | ogdf::GraphCopy | inline |
| original(adjEntry adj) const | ogdf::GraphCopy | inline |
| PlanRep(const Graph &G) | ogdf::PlanRep | explicit |
| PlanRep(const GraphAttributes &AG) | ogdf::PlanRep | explicit |
| pureNewNode() | ogdf::Graph | private |
| registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | |
| registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | |
| registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | |
| registerStructure(GraphObserver *pStructure) const | ogdf::Graph | |
| reinitArrays(bool doResetTableSizes=true) | ogdf::Graph | private |
| reinsertEdge(edge e) | ogdf::ClusterPlanRep | protected |
| 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 | |
| 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 |
| resetAdjEntryIndex(int newIndex, int oldIndex) | ogdf::Graph | private |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resetTableSizes() | ogdf::Graph | private |
| restoreAllEdges() | ogdf::Graph | private |
| 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 |
| setClusterBoundary(edge e) | ogdf::ClusterPlanRep | 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 |
| setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2) | ogdf::GraphCopy | protected |
| setOriginalEmbedding() | ogdf::GraphCopy | |
| 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 |
| setUserType(edge e, edgeType et) | ogdf::PlanRep | inline |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
| split(edge e) override | ogdf::ClusterPlanRep | 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 |
| unregisterArray(ListIterator< NodeArrayBase * > it) const | ogdf::Graph | |
| unregisterArray(ListIterator< EdgeArrayBase * > it) const | ogdf::Graph | |
| unregisterArray(ListIterator< AdjEntryArrayBase * > it) const | ogdf::Graph | |
| unregisterStructure(ListIterator< GraphObserver * > it) const | ogdf::Graph | |
| unsplit(edge eIn, edge eOut) override | ogdf::GraphCopy | virtual |
| ogdf::Graph::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::ClusterPlanRep | |
| writeGML(const char *fileName) | ogdf::ClusterPlanRep | |
| writeGML(std::ostream &os, const Layout &drawing) | ogdf::ClusterPlanRep | |
| 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 | |
| ~ClusterPlanRep() | ogdf::ClusterPlanRep | inlinevirtual |
| ~Graph() | ogdf::Graph | virtual |
| ~GraphCopy() | ogdf::GraphCopy | inlinevirtual |
| ~PlanRep() | ogdf::PlanRep | inlinevirtual |
