Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::EdgeIndependentSpanningTrees Member List

This is the complete list of members for ogdf::EdgeIndependentSpanningTrees, including all inherited members.

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