![]() |
Version: 1.0 |
#include <find_optimal_drag.h>
Public Member Functions | |
FindOptimalDrag (BinaryDrag< conact > t) | |
void | GetLeavesWithMultipleActionsRec (BinaryDrag< conact >::node *n) |
void | ReduceAndUpdateBest (BinaryDrag< conact > t) |
void | GenerateAllTreesRec (int cur_leaf) |
void | GenerateAllTrees () |
Public Attributes | |
std::vector< BinaryDrag< conact >::node * > | lma_ |
std::unordered_set< BinaryDrag< conact >::node * > | visited_ |
BinaryDrag< conact > | t_ |
BinaryDrag< conact > | best_tree_ |
uint | counter_ = 0 |
uint | best_nodes_ = std::numeric_limits<uint>::max() |
uint | best_leaves_ = std::numeric_limits<uint>::max() |
std::mutex | best_tree_mutex_ |
thread_pool * | pool_ = nullptr |
Definition at line 22 of file find_optimal_drag.h.
|
inline |
Definition at line 35 of file find_optimal_drag.h.
|
inline |
Definition at line 101 of file find_optimal_drag.h.
|
inline |
Definition at line 79 of file find_optimal_drag.h.
|
inline |
Definition at line 42 of file find_optimal_drag.h.
|
inline |
Definition at line 57 of file find_optimal_drag.h.
Definition at line 30 of file find_optimal_drag.h.
Definition at line 29 of file find_optimal_drag.h.
BinaryDrag<conact> FindOptimalDrag::best_tree_ |
Definition at line 27 of file find_optimal_drag.h.
std::mutex FindOptimalDrag::best_tree_mutex_ |
Definition at line 32 of file find_optimal_drag.h.
uint FindOptimalDrag::counter_ = 0 |
Definition at line 28 of file find_optimal_drag.h.
std::vector<BinaryDrag<conact>::node*> FindOptimalDrag::lma_ |
Definition at line 23 of file find_optimal_drag.h.
thread_pool* FindOptimalDrag::pool_ = nullptr |
Definition at line 33 of file find_optimal_drag.h.
BinaryDrag<conact> FindOptimalDrag::t_ |
Definition at line 25 of file find_optimal_drag.h.
std::unordered_set<BinaryDrag<conact>::node*> FindOptimalDrag::visited_ |
Definition at line 24 of file find_optimal_drag.h.