| checkIndependence(const std::vector< NodeArray< adjEntry > > &parents, unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | private |
| checkNewTree(const Solution &f1, const Solution &f2, unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | private |
| checkOnePermUnequal(const Solution &f1, const Solution &f2, const std::vector< unsigned int > &perm) const | ogdf::EdgeIndependentSpanningTrees | private |
| checkTwoPathIndependence(const std::vector< NodeArray< adjEntry > > &parents, node v, unsigned int p1, unsigned int p2) const | ogdf::EdgeIndependentSpanningTrees | private |
| clearTree(Solution &f, unsigned int j) const | ogdf::EdgeIndependentSpanningTrees | private |
| createInitialSpanningTrees(Solution &f, unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | private |
| createParentRel(const Solution &f, unsigned int j, NodeArray< adjEntry > &parent) const | ogdf::EdgeIndependentSpanningTrees | private |
| createVals(const Solution &f, unsigned int k, std::vector< edge > &tree) const | ogdf::EdgeIndependentSpanningTrees | private |
| EdgeIndependentSpanningTrees() | ogdf::EdgeIndependentSpanningTrees | inline |
| EdgeIndependentSpanningTrees(const Graph &G) | ogdf::EdgeIndependentSpanningTrees | inline |
| EdgeIndependentSpanningTrees(const Graph &G, node root) | ogdf::EdgeIndependentSpanningTrees | inline |
| findAll(unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | |
| findAllPerm(unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | |
| findAndInsertNextTree(Solution &f, unsigned int &t, unsigned int j, std::vector< edge > &tree) const | ogdf::EdgeIndependentSpanningTrees | private |
| findDo(unsigned int k, std::function< bool(Solution &)> func) const | ogdf::EdgeIndependentSpanningTrees | protected |
| findOne(unsigned int k, Solution &f) const | ogdf::EdgeIndependentSpanningTrees | |
| getGraph() const | ogdf::EdgeIndependentSpanningTrees | inline |
| getRoot() const | ogdf::EdgeIndependentSpanningTrees | inline |
| insertNewTree(Solution &f, unsigned int t, unsigned int j, std::vector< edge > &tree) const | ogdf::EdgeIndependentSpanningTrees | private |
| isFinished(const Solution &f, unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | private |
| isInSubGraph(const std::vector< edge > &sub, const edge &e, unsigned int t) const | ogdf::EdgeIndependentSpanningTrees | private |
| iterate(Solution &f, unsigned int j, unsigned int k) const | ogdf::EdgeIndependentSpanningTrees | private |
| m_G | ogdf::EdgeIndependentSpanningTrees | private |
| m_root | ogdf::EdgeIndependentSpanningTrees | private |
| nextSpanningTree(unsigned int &t, std::vector< edge > &tree) const | ogdf::EdgeIndependentSpanningTrees | private |
| pathExists(const std::vector< edge > &tree, node v1, node v2, unsigned int t) const | ogdf::EdgeIndependentSpanningTrees | private |
| setGraph(const Graph &G) | ogdf::EdgeIndependentSpanningTrees | inline |
| setRoot(node root) | ogdf::EdgeIndependentSpanningTrees | inline |
| Solution typedef | ogdf::EdgeIndependentSpanningTrees | |
| ~EdgeIndependentSpanningTrees()=default | ogdf::EdgeIndependentSpanningTrees | |
