, including all inherited members.
| adjEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline, protected] |
| adjEntries(node v, ADJLIST &entries) const | ogdf::Graph | [inline, protected] |
| adjEntryArrayTableSize() const | ogdf::Graph | [inline, protected] |
| align(bool b) | ogdf::CompactionConstraintGraphBase | [inline] |
| alignmentArc(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| allEdges(EDGELIST &edges) const | ogdf::Graph | [inline, protected] |
| allNodes(NODELIST &nodes) const | ogdf::Graph | [inline, protected] |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | [protected] |
| association enum value | ogdf::Graph | [protected] |
| associationClass enum value | ogdf::Graph | [protected] |
| basicArc(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| chooseEdge() const | ogdf::Graph | [protected] |
| chooseNode() const | ogdf::Graph | [protected] |
| clear() | ogdf::Graph | [protected] |
| collaps(NODELIST &nodes) | ogdf::Graph | [inline, protected] |
| 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::CompactionConstraintGraphBase | [protected] |
| consistencyCheck() const | ogdf::Graph | [protected] |
| construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | [protected] |
| constructInitByActiveNodes(const List< node > &nodes, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | [protected] |
| constructInitByNodes(const Graph &G, const List< node > &nodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | [protected] |
| contract(edge e) | ogdf::Graph | [protected] |
| delEdge(edge e) | ogdf::Graph | [protected] |
| delNode(node v) | ogdf::Graph | [protected] |
| dependency enum value | ogdf::Graph | [protected] |
| dfsInsertPathVertex(node v, node pathVertex, NodeArray< bool > &visited, const NodeArray< node > &genOpposite) | ogdf::CompactionConstraintGraphBase | [private] |
| dummy enum value | ogdf::Graph | [protected] |
| edgeArrayTableSize() const | ogdf::Graph | [inline, protected] |
| EdgeType enum name | ogdf::Graph | [protected] |
| embed() | ogdf::CompactionConstraintGraphBase | [protected] |
| empty() const | ogdf::Graph | [inline, protected] |
| firstEdge() const | ogdf::Graph | [inline, protected] |
| firstNode() const | ogdf::Graph | [inline, protected] |
| fixOnBorder(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| generalization enum value | ogdf::Graph | [protected] |
| generalizationExpander enum value | ogdf::Graph | [protected] |
| generalizationMerger enum value | ogdf::Graph | [protected] |
| genus() const | ogdf::Graph | [protected] |
| getPlanRep() const | ogdf::CompactionConstraintGraphBase | [inline] |
| Graph() | ogdf::Graph | [protected] |
| Graph(const Graph &G) | ogdf::Graph | [protected] |
| hideEdge(edge e) | ogdf::Graph | [protected] |
| highDegreeExpander enum value | ogdf::Graph | [protected] |
| inEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline, protected] |
| insertBasicArcs(const PlanRep &PG) | ogdf::CompactionConstraintGraphBase | [private] |
| insertPathVertices(const PlanRep &PG) | ogdf::CompactionConstraintGraphBase | [private] |
| lastEdge() const | ogdf::Graph | [inline, protected] |
| lastNode() const | ogdf::Graph | [inline, protected] |
| lowDegreeExpander enum value | ogdf::Graph | [protected] |
| m_align | ogdf::CompactionConstraintGraphBase | [private] |
| m_alignmentArc | ogdf::CompactionConstraintGraphBase | [protected] |
| m_arcDir | ogdf::CompactionConstraintGraphBase | [protected] |
| m_border | ogdf::CompactionConstraintGraphBase | [protected] |
| m_cost | ogdf::CompactionConstraintGraphBase | [protected] |
| m_edgeCost | ogdf::CompactionConstraintGraphBase | [protected] |
| m_edgeToBasicArc | ogdf::CompactionConstraintGraphBase | [protected] |
| m_oppArcDir | ogdf::CompactionConstraintGraphBase | [protected] |
| m_originalEdge | ogdf::CompactionConstraintGraphBase | [protected] |
| m_path | ogdf::CompactionConstraintGraphBase | [protected] |
| m_pathNode | ogdf::CompactionConstraintGraphBase | [protected] |
| m_pathToEdge | ogdf::CompactionConstraintGraphBase | [protected] |
| m_pOR | ogdf::CompactionConstraintGraphBase | [protected] |
| m_pPR | ogdf::CompactionConstraintGraphBase | [protected] |
| m_sinks | ogdf::CompactionConstraintGraphBase | [private] |
| m_sources | ogdf::CompactionConstraintGraphBase | [private] |
| m_superSink | ogdf::CompactionConstraintGraphBase | [private] |
| m_superSource | ogdf::CompactionConstraintGraphBase | [private] |
| m_type | ogdf::CompactionConstraintGraphBase | [protected] |
| m_verticalArc | ogdf::CompactionConstraintGraphBase | [protected] |
| m_verticalGen | ogdf::CompactionConstraintGraphBase | [protected] |
| maxAdjEntryIndex() const | ogdf::Graph | [inline, protected] |
| maxEdgeIndex() const | ogdf::Graph | [inline, protected] |
| maxNodeIndex() const | ogdf::Graph | [inline, protected] |
| move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt) | ogdf::Graph | [protected] |
| moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) | ogdf::Graph | [inline, protected] |
| moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) | ogdf::Graph | [inline, protected] |
| moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) | ogdf::Graph | [inline, protected] |
| 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=ogdf::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] |
| nextPower2(int start, int idCount) | ogdf::Graph | [protected, static] |
| nodeArrayTableSize() const | ogdf::Graph | [inline, protected] |
| NodeType enum name | ogdf::Graph | [protected] |
| numberOfEdges() const | ogdf::Graph | [inline, protected] |
| numberOfNodes() const | ogdf::Graph | [inline, protected] |
| onBorder(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| operator=(const Graph &G) | ogdf::Graph | [protected] |
| outEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline, protected] |
| pathToOriginal(node v) | ogdf::CompactionConstraintGraphBase | [inline] |
| readGML(const char *fileName) | ogdf::Graph | [protected] |
| readGML(istream &is) | ogdf::Graph | [protected] |
| readLEDAGraph(const char *fileName) | ogdf::Graph | [protected] |
| readLEDAGraph(istream &is) | ogdf::Graph | [protected] |
| 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] |
| removeRedundantVisibArcs(SListPure< Tuple2< node, node > > &visibArcs) | ogdf::CompactionConstraintGraphBase | [protected] |
| representsCombEmbedding() const | ogdf::Graph | [inline, protected] |
| resetEdgeIdCount(int maxId) | ogdf::Graph | [protected] |
| restoreAllEdges() | ogdf::Graph | [protected] |
| restoreEdge(edge e) | ogdf::Graph | [protected] |
| reverseAdjEdges(node v) | ogdf::Graph | [inline, protected] |
| reverseAdjEdges() | ogdf::Graph | [protected] |
| reverseAllEdges() | ogdf::Graph | [protected] |
| reverseEdge(edge e) | ogdf::Graph | [protected] |
| searchEdge(node v, node w) const | ogdf::Graph | [protected] |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | [inline, protected] |
| split(edge e) | ogdf::Graph | [protected, virtual] |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | [protected] |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | [inline, protected] |
| 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 | [protected, virtual] |
| vertex enum value | ogdf::Graph | [protected] |
| verticalArc(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| verticalGen(edge e) const | ogdf::CompactionConstraintGraphBase | [inline] |
| writeGML(const char *fileName) const | ogdf::CompactionConstraintGraphBase | |
| writeGML(ostream &os) const | ogdf::CompactionConstraintGraphBase | |
| writeGML(const char *fileName, NodeArray< bool > one) const | ogdf::CompactionConstraintGraphBase | |
| writeGML(ostream &os, NodeArray< bool > one) const | ogdf::CompactionConstraintGraphBase | |
| writeLength(ostream &os, edge e) const =0 | ogdf::CompactionConstraintGraphBase | [protected, pure virtual] |
| ~Graph() | ogdf::Graph | [protected, virtual] |
