| adjEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline] |
| adjEntries(node v, ADJLIST &entries) const | ogdf::Graph | [inline] |
| adjEntryArrayTableSize() const | ogdf::Graph | [inline] |
| allEdges(EDGELIST &edges) const | ogdf::Graph | [inline] |
| allNodes(NODELIST &nodes) const | ogdf::Graph | [inline] |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | [protected] |
| association enum value | ogdf::Graph | |
| associationClass enum value | ogdf::Graph | |
| chain(edge e) const | ogdf::GraphCopy | [inline] |
| chooseEdge() const | ogdf::Graph | |
| chooseNode() const | ogdf::Graph | |
| clear() | ogdf::Graph | |
| collaps(NODELIST &nodes) | ogdf::Graph | [inline] |
| consistencyCheck() const | ogdf::GraphCopy | |
| 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 | |
| copy(node v) const | ogdf::GraphCopy | [inline] |
| copy(edge e) const | ogdf::GraphCopy | [inline] |
| createEmpty(const Graph &G) | ogdf::GraphCopy | |
| delCopy(node v) | ogdf::GraphCopy | |
| delCopy(edge e) | ogdf::GraphCopy | |
| delEdge(edge e) | ogdf::Graph | |
| delNode(node v) | ogdf::Graph | |
| dependency enum value | ogdf::Graph | |
| dummy enum value | ogdf::Graph | |
| edgeArrayTableSize() const | ogdf::Graph | [inline] |
| EdgeType enum name | ogdf::Graph | |
| empty() const | ogdf::Graph | [inline] |
| firstEdge() const | ogdf::Graph | [inline] |
| firstNode() const | ogdf::Graph | [inline] |
| generalization enum value | ogdf::Graph | |
| generalizationExpander enum value | ogdf::Graph | |
| generalizationMerger enum value | ogdf::Graph | |
| genus() const | ogdf::Graph | |
| Graph() | ogdf::Graph | |
| Graph(const Graph &G) | ogdf::Graph | |
| GraphCopy(const Graph &G) | ogdf::GraphCopy | |
| GraphCopy() | ogdf::GraphCopy | [inline] |
| GraphCopy(const GraphCopy &GC) | ogdf::GraphCopy | |
| hideEdge(edge e) | ogdf::Graph | |
| highDegreeExpander enum value | ogdf::Graph | |
| inEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline] |
| initByActiveNodes(const List< node > &nodes, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | |
| initByNodes(const List< node > &nodes, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | |
| initGC(const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | [private] |
| insertCrossing(edge &crossingEdge, edge crossedEdge, bool topDown) | ogdf::GraphCopy | |
| insertEdgePath(edge eOrig, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| isDummy(node v) const | ogdf::GraphCopy | [inline] |
| isDummy(edge e) const | ogdf::GraphCopy | [inline] |
| isReversed(edge e) const | ogdf::GraphCopy | [inline] |
| lastEdge() const | ogdf::Graph | [inline] |
| lastNode() const | ogdf::Graph | [inline] |
| lowDegreeExpander enum value | ogdf::Graph | |
| m_eCopy | ogdf::GraphCopy | [protected] |
| m_eIterator | ogdf::GraphCopy | [protected] |
| m_eOrig | ogdf::GraphCopy | [protected] |
| m_pGraph | ogdf::GraphCopy | [protected] |
| m_vCopy | ogdf::GraphCopy | [protected] |
| m_vOrig | ogdf::GraphCopy | [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] |
| 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 | |
| newEdge(edge eOrig) | ogdf::GraphCopy | |
| newEdge(edge eOrig, adjEntry adjSrc, node w) | ogdf::GraphCopy | |
| newEdge(edge eOrig, node v, adjEntry adjTgt) | ogdf::GraphCopy | |
| newEdge(node v, node w) | ogdf::GraphCopy | [inline] |
| newEdge(adjEntry adjSrc, adjEntry adjTgt) | ogdf::GraphCopy | [inline] |
| newEdge(node v, adjEntry adjTgt) | ogdf::GraphCopy | [inline] |
| newEdge(adjEntry adjSrc, node w) | ogdf::GraphCopy | [inline] |
| newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E) | ogdf::GraphCopy | |
| ogdf::Graph::newEdge(node v, node w, int index) | ogdf::Graph | |
| ogdf::Graph::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::after) | ogdf::Graph | |
| newNode() | ogdf::GraphCopy | [inline] |
| newNode(node vOrig) | ogdf::GraphCopy | [inline] |
| ogdf::Graph::newNode(int index) | ogdf::Graph | |
| nextPower2(int start, int idCount) | ogdf::Graph | [static] |
| nodeArrayTableSize() const | ogdf::Graph | [inline] |
| NodeType enum name | ogdf::Graph | |
| numberOfEdges() const | ogdf::Graph | [inline] |
| numberOfNodes() const | ogdf::Graph | [inline] |
| operator delete(void *p, size_t nBytes) | ogdf::Graph | [inline] |
| operator new(size_t nBytes) | ogdf::Graph | [inline] |
| operator new(size_t, void *p) | ogdf::Graph | [inline] |
| operator=(const GraphCopy &GC) | ogdf::GraphCopy | |
| ogdf::Graph::operator=(const Graph &G) | ogdf::Graph | |
| original() const | ogdf::GraphCopy | [inline] |
| original(node v) const | ogdf::GraphCopy | [inline] |
| original(edge e) const | ogdf::GraphCopy | [inline] |
| outEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline] |
| readGML(const char *fileName) | ogdf::Graph | |
| readGML(istream &is) | ogdf::Graph | |
| readLEDAGraph(const char *fileName) | ogdf::Graph | |
| readLEDAGraph(istream &is) | ogdf::Graph | |
| registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | |
| registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | |
| registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | |
| registerStructure(GraphObserver *pStructure) const | ogdf::Graph | |
| removeEdgePath(edge eOrig) | ogdf::GraphCopy | |
| removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, FaceSetPure &newFaces) | ogdf::GraphCopy | |
| representsCombEmbedding() const | ogdf::Graph | [inline] |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| restoreAllEdges() | ogdf::Graph | |
| restoreEdge(edge e) | ogdf::Graph | |
| reverseAdjEdges(node v) | ogdf::Graph | [inline] |
| reverseAdjEdges() | ogdf::Graph | |
| reverseAllEdges() | ogdf::Graph | |
| reverseEdge(edge e) | ogdf::Graph | |
| searchEdge(node v, node w) const | ogdf::Graph | |
| setEdge(edge eOrig, edge eCopy) | ogdf::GraphCopy | |
| setOriginalEmbedding() | ogdf::GraphCopy | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | [inline] |
| split(edge e) | ogdf::GraphCopy | [virtual] |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | [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) | ogdf::GraphCopy | [virtual] |
| ogdf::Graph::unsplit(node u) | ogdf::Graph | |
| vertex enum value | ogdf::Graph | |
| writeGML(const char *fileName) const | ogdf::Graph | |
| writeGML(ostream &os) const | ogdf::Graph | |
| ~Graph() | ogdf::Graph | [virtual] |
| ~GraphCopy() | ogdf::GraphCopy | [inline, virtual] |
