This is the complete list of members for ogdf::PlanarSubgraphTriangles< TCost >, including all inherited members.
| call(const Graph &G, const EdgeArray< TCost > &cost, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false) | ogdf::PlanarSubgraphModule< TCost > | inline |
| call(const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false) | ogdf::PlanarSubgraphModule< TCost > | inline |
| call(const Graph &G, const EdgeArray< TCost > &cost, List< edge > &delEdges) | ogdf::PlanarSubgraphModule< TCost > | inline |
| call(const Graph &G, List< edge > &delEdges) | ogdf::PlanarSubgraphModule< TCost > | inline |
| callAndDelete(GraphCopy &GC, const List< edge > &preferredEdges, List< edge > &delOrigEdges, bool preferredImplyPlanar=false) | ogdf::PlanarSubgraphModule< TCost > | inline |
| callAndDelete(GraphCopy &GC, List< edge > &delOrigEdges) | ogdf::PlanarSubgraphModule< TCost > | inline |
| clone() const override | ogdf::PlanarSubgraphTriangles< TCost > | inlinevirtual |
| doCall(const Graph &graph, const List< edge > &, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferredImplyPlanar=false) override | ogdf::PlanarSubgraphTriangles< TCost > | inlineprotectedvirtual |
| findTriangle(GraphCopy ©, edge currentEdge, const EdgeArray< TCost > *pCost, DisjointSets<> &components, NodeArray< int > &set, std::function< bool(node, edge, edge)> callback) | ogdf::PlanarSubgraphTriangles< TCost > | inlineprivate |
| isSolution(ReturnType ret) | ogdf::Module | inlinestatic |
| isTimeLimit() const | ogdf::Timeouter | inline |
| m_maxThreads | ogdf::PlanarSubgraphModule< TCost > | private |
| m_onlyTriangles | ogdf::PlanarSubgraphTriangles< TCost > | private |
| m_timeLimit | ogdf::Timeouter | protected |
| maxThreads() const | ogdf::PlanarSubgraphModule< TCost > | inline |
| maxThreads(unsigned int n) | ogdf::PlanarSubgraphModule< TCost > | inline |
| Module() | ogdf::Module | inline |
| operator()(const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false) | ogdf::PlanarSubgraphModule< TCost > | inline |
| operator()(const Graph &G, List< edge > &delEdges) | ogdf::PlanarSubgraphModule< TCost > | inline |
| operator=(const Timeouter &t) | ogdf::Timeouter | inline |
| PlanarSubgraphModule() | ogdf::PlanarSubgraphModule< TCost > | inline |
| PlanarSubgraphTriangles(bool onlyTriangles=false) | ogdf::PlanarSubgraphTriangles< TCost > | inline |
| ReturnType enum name | ogdf::Module | |
| searchEdge(node target, node source, internal::GraphIterator< adjEntry > connectionIterator) | ogdf::PlanarSubgraphTriangles< TCost > | inlineprivate |
| 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 | inlineexplicit |
| Timeouter(bool t) | ogdf::Timeouter | inlineexplicit |
| Timeouter(const Timeouter &t) | ogdf::Timeouter | inline |
| ~Module() | ogdf::Module | inlinevirtual |
| ~Timeouter() | ogdf::Timeouter | inline |