| adjEntry_iterator typedef | ogdf::Graph | protected |
| adjEntryArrayTableSize() const | ogdf::Graph | inlineprotected |
| align(bool b) | ogdf::CompactionConstraintGraphBase | inline |
| alignmentArc(edge e) const | ogdf::CompactionConstraintGraphBase | inline |
| allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inlineprotected |
| allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inlineprotected |
| areMulti(edge e1, edge e2) const | ogdf::CompactionConstraintGraph< ATYPE > | |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| basicArc(edge e) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| c_bungeeFactor | ogdf::CompactionConstraintGraph< ATYPE > | privatestatic |
| c_doubleBendFactor | ogdf::CompactionConstraintGraph< ATYPE > | privatestatic |
| c_MedianFactor | ogdf::CompactionConstraintGraph< ATYPE > | privatestatic |
| c_vertexArcFactor | ogdf::CompactionConstraintGraph< ATYPE > | privatestatic |
| centerPriority() | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| centerPriority(bool b) | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| checkSweepLine(const List< Interval > &sweepLine) const | ogdf::CompactionConstraintGraph< ATYPE > | private |
| chooseEdge(std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const | ogdf::Graph | protected |
| chooseNode(std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const | ogdf::Graph | protected |
| clear() | ogdf::Graph | protectedvirtual |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inlineprotected |
| CommonCompactionConstraintGraphBase(const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, int costAssoc) | ogdf::CommonCompactionConstraintGraphBase | protected |
| CompactionConstraintGraph(const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, ATYPE sep, int costGen=1, int costAssoc=1, bool align=false) | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| CompactionConstraintGraphBase(const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, int costGen=1, int costAssoc=1, bool align=false) | ogdf::CompactionConstraintGraphBase | protected |
| computeTopologicalSegmentNum(NodeArray< int > &topNum) | ogdf::CommonCompactionConstraintGraphBase | |
| computeTotalCosts(const NodeArray< ATYPE > &pos) const | ogdf::CompactionConstraintGraph< ATYPE > | |
| 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 | protected |
| copy(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | private |
| copy(const Graph &G) | ogdf::Graph | private |
| cost(edge e) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) | ogdf::Graph | private |
| delEdge(edge e) | ogdf::Graph | protectedvirtual |
| delNode(node v) | ogdf::Graph | protectedvirtual |
| dfsInsertPathVertex(node v, node pathVertex, NodeArray< bool > &visited, const NodeArray< node > &genOpposite) | ogdf::CompactionConstraintGraphBase | private |
| edge_iterator typedef | ogdf::Graph | protected |
| edgeArrayTableSize() const | ogdf::Graph | inlineprotected |
| edges | ogdf::Graph | protected |
| EdgeType enum name | ogdf::Graph | protected |
| embed() | ogdf::CommonCompactionConstraintGraphBase | |
| empty() const | ogdf::Graph | inlineprotected |
| extraNode(node v) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| extraOfs(node v) const | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| extraRep(node v) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| firstEdge() const | ogdf::Graph | inlineprotected |
| firstNode() const | ogdf::Graph | inlineprotected |
| fixOnBorder(edge e) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| genus() const | ogdf::Graph | protected |
| getGraph() const | ogdf::CommonCompactionConstraintGraphBase | inline |
| getGraph() | ogdf::CommonCompactionConstraintGraphBase | inline |
| getLengthString(edge e) const override | ogdf::CompactionConstraintGraph< ATYPE > | inlineprivatevirtual |
| getOrthoRep() const | ogdf::CommonCompactionConstraintGraphBase | inline |
| getPlanRep() const | ogdf::CommonCompactionConstraintGraphBase | inline |
| Graph() | ogdf::Graph | protected |
| Graph(const Graph &G) | ogdf::Graph | protected |
| initializeCosts() | ogdf::CompactionConstraintGraph< ATYPE > | inlineprotected |
| insert(const Graph &G, NodeArray< node > &nodeMap) | ogdf::Graph | protected |
| insert(const Graph &G) | ogdf::Graph | protected |
| insertBasicArcs(const PlanRep &PG) | ogdf::CompactionConstraintGraphBase | private |
| insertPathVertices(const PlanRep &PG) | ogdf::CompactionConstraintGraphBase | private |
| insertVertexSizeArcs(const PlanRep &PG, const NodeArray< ATYPE > &sizeOrig, const RoutingChannel< ATYPE > &rc) | ogdf::CompactionConstraintGraph< ATYPE > | |
| insertVertexSizeArcs(const PlanRep &PG, const NodeArray< ATYPE > &sizeOrig, const MinimumEdgeDistances< ATYPE > &minDist) | ogdf::CompactionConstraintGraph< ATYPE > | |
| insertVisibilityArcs(const PlanRep &PG, const NodeArray< ATYPE > &posDir, const NodeArray< ATYPE > &posOppDir) | ogdf::CompactionConstraintGraph< ATYPE > | |
| insertVisibilityArcs(const PlanRep &PG, const NodeArray< ATYPE > &posDir, const NodeArray< ATYPE > &posOrthDir, const MinimumEdgeDistances< ATYPE > &minDist) | ogdf::CompactionConstraintGraph< ATYPE > | |
| isFeasible(const NodeArray< ATYPE > &pos) | ogdf::CompactionConstraintGraph< ATYPE > | |
| lastEdge() const | ogdf::Graph | inlineprotected |
| lastNode() const | ogdf::Graph | inlineprotected |
| length(edge e) const | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| m_align | ogdf::CompactionConstraintGraphBase | private |
| m_alignmentArc | ogdf::CompactionConstraintGraphBase | protected |
| m_arcDir | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_border | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_bungeeCost | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_centerPriority | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_cost | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_doubleBendCost | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_edgeArrayTableSize | ogdf::Graph | private |
| m_edgeCost | ogdf::CompactionConstraintGraphBase | protected |
| m_edgeIdCount | ogdf::Graph | private |
| m_edgeToBasicArc | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_extraNode | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_extraOfs | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_extraRep | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_genToMedian | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_length | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_MedianArcCost | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_mutexRegArrays | ogdf::Graph | mutableprivate |
| m_nodeArrayTableSize | ogdf::Graph | private |
| m_nodeIdCount | ogdf::Graph | private |
| m_oppArcDir | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_originalEdge | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_path | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_pathNode | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_pathToEdge | ogdf::CompactionConstraintGraphBase | protected |
| m_pOR | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_pPR | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_regAdjArrays | ogdf::Graph | mutableprivate |
| m_regEdgeArrays | ogdf::Graph | mutableprivate |
| m_regNodeArrays | ogdf::Graph | mutableprivate |
| m_regStructures | ogdf::Graph | mutableprivate |
| m_sep | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_sinks | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_sources | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_type | ogdf::CommonCompactionConstraintGraphBase | protected |
| m_vertexArcCost | ogdf::CompactionConstraintGraph< ATYPE > | private |
| m_verticalArc | ogdf::CompactionConstraintGraphBase | protected |
| m_verticalGen | ogdf::CompactionConstraintGraphBase | protected |
| maxAdjEntryIndex() const | ogdf::Graph | inlineprotected |
| maxEdgeIndex() const | ogdf::Graph | inlineprotected |
| maxNodeIndex() const | ogdf::Graph | inlineprotected |
| move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt) | ogdf::Graph | protected |
| moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) | ogdf::Graph | inlineprotected |
| moveAdj(adjEntry adj, node w) | ogdf::Graph | private |
| moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) | ogdf::Graph | inlineprotected |
| moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) | ogdf::Graph | inlineprotected |
| moveRegisterArray(ListIterator< ArrayBase * > it, ArrayBase *pArray) const | ogdf::Graph | inlineprotected |
| moveSource(edge e, node w) | ogdf::Graph | protected |
| moveSource(edge e, adjEntry adjSrc, Direction dir) | ogdf::Graph | protected |
| moveTarget(edge e, node w) | ogdf::Graph | protected |
| moveTarget(edge e, adjEntry adjTgt, Direction dir) | ogdf::Graph | protected |
| newEdge(node v, node w) | ogdf::Graph | protected |
| newEdge(node v, node w, int index) | ogdf::Graph | protected |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after) | ogdf::Graph | protected |
| newEdge(node v, adjEntry adjTgt) | ogdf::Graph | protected |
| newEdge(adjEntry adjSrc, node w) | ogdf::Graph | protected |
| newNode() | ogdf::Graph | protected |
| newNode(int index) | ogdf::Graph | protected |
| node_iterator typedef | ogdf::Graph | protected |
| nodeArrayTableSize() const | ogdf::Graph | inlineprotected |
| nodes | ogdf::Graph | protected |
| nodesIn(node v) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| NodeType enum name | ogdf::Graph | protected |
| numberOfEdges() const | ogdf::Graph | inlineprotected |
| numberOfNodes() const | ogdf::Graph | inlineprotected |
| onBorder(edge e) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| operator=(const Graph &G) | ogdf::Graph | protected |
| pathNodeOf(node v) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| pathToOriginal(node v) | ogdf::CompactionConstraintGraphBase | inline |
| pureNewNode() | ogdf::Graph | private |
| registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | protected |
| registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | protected |
| registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | protected |
| registerStructure(GraphObserver *pStructure) const | ogdf::Graph | protected |
| reinitArrays(bool doResetTableSizes=true) | ogdf::Graph | private |
| removeRedundantVisibArcs(SListPure< Tuple2< node, node > > &visibArcs) | ogdf::CommonCompactionConstraintGraphBase | |
| representsCombEmbedding() const | ogdf::Graph | inlineprotected |
| resetAdjEntryIndex(int newIndex, int oldIndex) | ogdf::Graph | private |
| resetEdgeIdCount(int maxId) | ogdf::Graph | protected |
| resetGenMergerLengths(const PlanRep &PG, adjEntry adjFirst) | ogdf::CompactionConstraintGraph< ATYPE > | private |
| resetTableSizes() | ogdf::Graph | private |
| restoreAllEdges() | ogdf::Graph | private |
| reverseAdjEdges(node v) | ogdf::Graph | inlineprotected |
| reverseAdjEdges() | ogdf::Graph | protected |
| reverseAllEdges() | ogdf::Graph | protected |
| reverseEdge(edge e) | ogdf::Graph | protected |
| searchEdge(node v, node w, bool directed=false) const | ogdf::Graph | protected |
| separation() const | ogdf::CompactionConstraintGraph< ATYPE > | inline |
| setBasicArcsZeroLength(const PlanRep &PG) | ogdf::CompactionConstraintGraph< ATYPE > | private |
| setBoundaryCosts(adjEntry cornerDir, adjEntry cornerOppDir) | ogdf::CompactionConstraintGraph< ATYPE > | private |
| setExtra(node v, node rep, ATYPE ofs) | ogdf::CompactionConstraintGraph< ATYPE > | inlineprotected |
| setMinimumSeparation(const PlanRep &PG, const NodeArray< int > &coord, const MinimumEdgeDistances< ATYPE > &minDist) | ogdf::CompactionConstraintGraph< ATYPE > | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inlineprotected |
| split(edge e) | ogdf::Graph | protectedvirtual |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | protected |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inlineprotected |
| typeOf(edge e) const | ogdf::CommonCompactionConstraintGraphBase | inline |
| unregisterArray(ListIterator< NodeArrayBase * > it) const | ogdf::Graph | protected |
| unregisterArray(ListIterator< EdgeArrayBase * > it) const | ogdf::Graph | protected |
| unregisterArray(ListIterator< AdjEntryArrayBase * > it) const | ogdf::Graph | protected |
| unregisterStructure(ListIterator< GraphObserver * > it) const | ogdf::Graph | protected |
| unsplit(node u) | ogdf::Graph | protected |
| unsplit(edge eIn, edge eOut) | ogdf::Graph | protectedvirtual |
| verticalArc(edge e) const | ogdf::CompactionConstraintGraphBase | inline |
| verticalGen(edge e) const | ogdf::CompactionConstraintGraphBase | inline |
| ~Graph() | ogdf::Graph | protectedvirtual |
