, including all inherited members.
| 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 eOrig) const | ogdf::PlanRepExpansion | [inline] |
| chooseEdge() const | ogdf::Graph | |
| chooseNode() const | ogdf::Graph | |
| clear() | ogdf::Graph | |
| collaps(NODELIST &nodes) | ogdf::Graph | [inline] |
| computeNumberOfCrossings() const | ogdf::PlanRepExpansion | |
| consistencyCheck() const | ogdf::PlanRepExpansion | |
| 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 | |
| contractSplit(nodeSplit ns, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| contractSplit(nodeSplit ns) | ogdf::PlanRepExpansion | |
| convertDummy(node u, node vOrig, PlanRepExpansion::nodeSplit ns) | ogdf::PlanRepExpansion | |
| copy(node vOrig) const | ogdf::PlanRepExpansion | [inline] |
| copy(edge eOrig) const | ogdf::PlanRepExpansion | [inline] |
| currentCC() const | ogdf::PlanRepExpansion | [inline] |
| delCopy(edge e) | ogdf::PlanRepExpansion | |
| delEdge(edge e) | ogdf::Graph | |
| delNode(node v) | ogdf::Graph | |
| dependency enum value | ogdf::Graph | |
| doInit(const Graph &G, const List< node > &splittableNodes) | ogdf::PlanRepExpansion | [private] |
| dummy enum value | ogdf::Graph | |
| edgeArrayTableSize() const | ogdf::Graph | [inline] |
| EdgeType enum name | ogdf::Graph | |
| embed() | ogdf::PlanRepExpansion | |
| empty() const | ogdf::Graph | [inline] |
| enlargeSplit(node v, edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| enlargeSplit(node v, edge e) | ogdf::PlanRepExpansion | |
| expansion(node vOrig) const | ogdf::PlanRepExpansion | [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 | |
| hideEdge(edge e) | ogdf::Graph | |
| highDegreeExpander enum value | ogdf::Graph | |
| inEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline] |
| initCC(int i) | ogdf::PlanRepExpansion | |
| insertEdgePath(edge eOrig, nodeSplit ns, node vStart, node vEnd, List< Crossing > &eip, edge eSrc, edge eTgt) | ogdf::PlanRepExpansion | |
| insertEdgePathEmbedded(edge eOrig, nodeSplit ns, CombinatorialEmbedding &E, const List< Tuple2< adjEntry, adjEntry > > &crossedEdges) | ogdf::PlanRepExpansion | |
| isPseudoCrossing(node v) const | ogdf::PlanRepExpansion | |
| lastEdge() const | ogdf::Graph | [inline] |
| lastNode() const | ogdf::Graph | [inline] |
| lowDegreeExpander enum value | ogdf::Graph | |
| m_currentCC | ogdf::PlanRepExpansion | [private] |
| m_eAuxCopy | ogdf::PlanRepExpansion | [private] |
| m_eCopy | ogdf::PlanRepExpansion | [private] |
| m_eIterator | ogdf::PlanRepExpansion | [private] |
| m_eNodeSplit | ogdf::PlanRepExpansion | [private] |
| m_eOrig | ogdf::PlanRepExpansion | [private] |
| m_nodesInCC | ogdf::PlanRepExpansion | [private] |
| m_nodeSplits | ogdf::PlanRepExpansion | [private] |
| m_numCC | ogdf::PlanRepExpansion | [private] |
| m_pGraph | ogdf::PlanRepExpansion | [private] |
| m_splittable | ogdf::PlanRepExpansion | [private] |
| m_splittableOrig | ogdf::PlanRepExpansion | [private] |
| m_vCopy | ogdf::PlanRepExpansion | [private] |
| m_vIterator | ogdf::PlanRepExpansion | [private] |
| m_vOrig | ogdf::PlanRepExpansion | [private] |
| 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(node v, node w) | ogdf::Graph | |
| newEdge(node v, node w, int index) | ogdf::Graph | |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::after) | ogdf::Graph | |
| newEdge(node v, adjEntry adjTgt) | ogdf::Graph | |
| newEdge(adjEntry adjSrc, node w) | ogdf::Graph | |
| newNode() | ogdf::Graph | |
| newNode(int index) | ogdf::Graph | |
| nextPower2(int start, int idCount) | ogdf::Graph | [static] |
| nodeArrayTableSize() const | ogdf::Graph | [inline] |
| nodesInCC(int i) const | ogdf::PlanRepExpansion | [inline] |
| nodesInCC() const | ogdf::PlanRepExpansion | [inline] |
| nodeSplit typedef | ogdf::PlanRepExpansion | |
| nodeSplitOf(edge e) const | ogdf::PlanRepExpansion | [inline] |
| nodeSplits() | ogdf::PlanRepExpansion | [inline] |
| NodeType enum name | ogdf::Graph | |
| numberOfCCs() const | ogdf::PlanRepExpansion | [inline] |
| numberOfEdges() const | ogdf::Graph | [inline] |
| numberOfNodes() const | ogdf::Graph | [inline] |
| numberOfNodeSplits() const | ogdf::PlanRepExpansion | [inline] |
| numberOfSplittedNodes() const | ogdf::PlanRepExpansion | |
| 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 Graph &G) | ogdf::Graph | |
| original() const | ogdf::PlanRepExpansion | [inline] |
| original(node v) const | ogdf::PlanRepExpansion | [inline] |
| originalEdge(edge e) const | ogdf::PlanRepExpansion | [inline] |
| outEdges(node v, EDGELIST &edges) const | ogdf::Graph | [inline] |
| PlanRepExpansion(const Graph &G) | ogdf::PlanRepExpansion | |
| PlanRepExpansion(const Graph &G, const List< node > &splittableNodes) | ogdf::PlanRepExpansion | |
| position(edge e) const | ogdf::PlanRepExpansion | [inline] |
| prepareNodeSplit(const SList< adjEntry > &partitionLeft, adjEntry &adjLeft, adjEntry &adjRight) | ogdf::PlanRepExpansion | [private] |
| 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, nodeSplit ns, node &oldSrc, node &oldTgt) | ogdf::PlanRepExpansion | |
| removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, nodeSplit ns, FaceSetPure &newFaces, NodeSetPure &mergedNodes, node &oldSrc, node &oldTgt) | ogdf::PlanRepExpansion | |
| removeSelfLoop(edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| removeSelfLoop(edge e) | ogdf::PlanRepExpansion | |
| representsCombEmbedding() const | ogdf::Graph | [inline] |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resolvePseudoCrossing(node v) | ogdf::PlanRepExpansion | |
| 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 | |
| separateDummy(adjEntry adj_1, adjEntry adj_2, node vStraight, bool isSrc) | ogdf::PlanRepExpansion | |
| setOrigs(edge e, edge &eOrig, nodeSplit &ns) | ogdf::PlanRepExpansion | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | [inline] |
| split(edge e) | ogdf::PlanRepExpansion | [virtual] |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| splitNodeSplit(edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| splitNodeSplit(edge e) | ogdf::PlanRepExpansion | |
| splittable(node v) const | ogdf::PlanRepExpansion | [inline] |
| splittableOrig(node vOrig) const | ogdf::PlanRepExpansion | [inline] |
| 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::PlanRepExpansion | [virtual] |
| ogdf::Graph::unsplit(node u) | ogdf::Graph | |
| unsplitExpandNode(node u, edge eContract, edge eExpand, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| unsplitExpandNode(node u, edge eContract, edge eExpand) | ogdf::PlanRepExpansion | |
| vertex enum value | ogdf::Graph | |
| writeGML(const char *fileName) const | ogdf::Graph | |
| writeGML(ostream &os) const | ogdf::Graph | |
| ~Graph() | ogdf::Graph | [virtual] |
| ~PlanRepExpansion() | ogdf::PlanRepExpansion | [inline] |
