| blockInsert(const BiconnectedComponent &G, node s, node t, List< adjEntry > &L) | ogdf::VariableEmbeddingInserter | [private] |
| buildSubpath(node v, edge eIn, edge eOut, List< adjEntry > &L, ExpandedGraph &Exp, node s, node t) | ogdf::VariableEmbeddingInserter | [private] |
| call(PlanRep &PG, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| call(PlanRep &PG, const EdgeArray< int > &costOrig, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| call(PlanRep &PG, const EdgeArray< int > &costOrig, const List< edge > &origEdges, const EdgeArray< unsigned int > &edgeSubGraph) | ogdf::EdgeInsertionModule | [inline] |
| call(PlanRep &PG, const EdgeArray< bool > &forbidOriginal, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| call(PlanRep &PG, const EdgeArray< int > &costOrig, const EdgeArray< bool > &forbidOriginal, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| call(PlanRep &PG, const EdgeArray< int > &costOrig, const EdgeArray< bool > &forbidOriginal, const List< edge > &origEdges, const EdgeArray< unsigned int > &edgeSubGraph) | ogdf::EdgeInsertionModule | [inline] |
| callForbidCrossingGens(PlanRepUML &PG, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| callForbidCrossingGens(PlanRepUML &PG, const EdgeArray< int > &costOrig, const List< edge > &origEdges) | ogdf::EdgeInsertionModule | [inline] |
| costCrossed(edge eOrig) const | ogdf::VariableEmbeddingInserter | [private] |
| crossedEdge(adjEntry adj) const | ogdf::VariableEmbeddingInserter | [private] |
| dfsComp(int i, node parent, node &repT) | ogdf::VariableEmbeddingInserter | [private] |
| dfsVertex(node v, int parent) | ogdf::VariableEmbeddingInserter | [private] |
| doCall(PlanRep &PG, const List< edge > &origEdges, bool forbidCrossingGens, const EdgeArray< int > *costOrig, const EdgeArray< bool > *forbiddenEdgeOrig, const EdgeArray< unsigned int > *edgeSubGraph) | ogdf::VariableEmbeddingInserter | [private, virtual] |
| EdgeInsertionModule() | ogdf::EdgeInsertionModule | [inline] |
| insert(node s, node t, SList< adjEntry > &eip) | ogdf::VariableEmbeddingInserter | [private] |
| insertEdge(node v, node w, Graph &Exp, NodeArray< node > &GtoExp, List< node > &nodesG) | ogdf::VariableEmbeddingInserter | [private] |
| isSolution(ReturnType ret) | ogdf::Module | [inline, static] |
| isTimeLimit() const | ogdf::Timeouter | [inline] |
| m_bigM | ogdf::VariableEmbeddingInserter | [private, static] |
| m_compV | ogdf::VariableEmbeddingInserter | [private] |
| m_costOrig | ogdf::VariableEmbeddingInserter | [private] |
| m_edgeB | ogdf::VariableEmbeddingInserter | [private] |
| m_edgeSubgraph | ogdf::VariableEmbeddingInserter | [private] |
| m_forbidCrossingGens | ogdf::VariableEmbeddingInserter | [private] |
| m_forbiddenEdgeOrig | ogdf::VariableEmbeddingInserter | [private] |
| m_GtoBC | ogdf::VariableEmbeddingInserter | [private] |
| m_nodeB | ogdf::VariableEmbeddingInserter | [private] |
| m_pEip | ogdf::VariableEmbeddingInserter | [private] |
| m_percentMostCrossed | ogdf::VariableEmbeddingInserter | [private] |
| m_pPG | ogdf::VariableEmbeddingInserter | [private] |
| m_rrOption | ogdf::VariableEmbeddingInserter | [private] |
| m_runsPostprocessing | ogdf::VariableEmbeddingInserter | [private] |
| m_s | ogdf::VariableEmbeddingInserter | [private] |
| m_st | ogdf::VariableEmbeddingInserter | [private] |
| m_t | ogdf::VariableEmbeddingInserter | [private] |
| m_timeLimit | ogdf::Timeouter | [protected] |
| m_typeOfCurrentEdge | ogdf::VariableEmbeddingInserter | [private] |
| m_v1 | ogdf::VariableEmbeddingInserter | [private] |
| m_v2 | ogdf::VariableEmbeddingInserter | [private] |
| Module() | ogdf::Module | [inline] |
| operator delete(void *p) | ogdf::EdgeInsertionModule | [inline] |
| operator new(size_t nBytes) | ogdf::EdgeInsertionModule | [inline] |
| operator new(size_t, void *p) | ogdf::EdgeInsertionModule | [inline] |
| pathSearch(node v, edge parent, List< edge > &path) | ogdf::VariableEmbeddingInserter | [private] |
| percentMostCrossed(double percent) | ogdf::VariableEmbeddingInserter | [inline] |
| percentMostCrossed() const | ogdf::VariableEmbeddingInserter | [inline] |
| removeReinsert(RemoveReinsertType rrOption) | ogdf::VariableEmbeddingInserter | [inline] |
| removeReinsert() const | ogdf::VariableEmbeddingInserter | [inline] |
| RemoveReinsertType enum name | ogdf::EdgeInsertionModule | |
| retError enum value | ogdf::Module | |
| retFeasible enum value | ogdf::Module | |
| retNoFeasibleSolution enum value | ogdf::Module | |
| retOptimal enum value | ogdf::Module | |
| retTimeoutFeasible enum value | ogdf::Module | |
| retTimeoutInfeasible enum value | ogdf::Module | |
| ReturnType enum name | ogdf::Module | |
| rrAll enum value | ogdf::EdgeInsertionModule | |
| rrIncremental enum value | ogdf::EdgeInsertionModule | |
| rrInserted enum value | ogdf::EdgeInsertionModule | |
| rrMostCrossed enum value | ogdf::EdgeInsertionModule | |
| rrNone enum value | ogdf::EdgeInsertionModule | |
| runsPostprocessing() const | ogdf::VariableEmbeddingInserter | [inline, virtual] |
| timeLimit(double t) | ogdf::Timeouter | [inline] |
| timeLimit(bool t) | ogdf::Timeouter | [inline] |
| timeLimit() const | ogdf::Timeouter | [inline] |
| Timeouter() | ogdf::Timeouter | [inline] |
| Timeouter(double t) | ogdf::Timeouter | [inline] |
| Timeouter(bool t) | ogdf::Timeouter | [inline] |
| Timeouter(const Timeouter &t) | ogdf::Timeouter | [inline] |
| VariableEmbeddingInserter() | ogdf::VariableEmbeddingInserter | |
| ~EdgeInsertionModule() | ogdf::EdgeInsertionModule | [inline, virtual] |
| ~Module() | ogdf::Module | [inline, virtual] |
| ~Timeouter() | ogdf::Timeouter | [inline] |
| ~VariableEmbeddingInserter() | ogdf::VariableEmbeddingInserter | [inline] |
