Version: 1.0
Public Member Functions | Public Attributes | List of all members
FindOptimalDrag Struct Reference

#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< conactt_
 
BinaryDrag< conactbest_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_poolpool_ = nullptr
 

Detailed Description

Definition at line 22 of file find_optimal_drag.h.

Constructor & Destructor Documentation

◆ FindOptimalDrag()

FindOptimalDrag::FindOptimalDrag ( BinaryDrag< conact t)
inline

Definition at line 35 of file find_optimal_drag.h.

Member Function Documentation

◆ GenerateAllTrees()

void FindOptimalDrag::GenerateAllTrees ( )
inline

Definition at line 101 of file find_optimal_drag.h.

◆ GenerateAllTreesRec()

void FindOptimalDrag::GenerateAllTreesRec ( int  cur_leaf)
inline

Definition at line 79 of file find_optimal_drag.h.

◆ GetLeavesWithMultipleActionsRec()

void FindOptimalDrag::GetLeavesWithMultipleActionsRec ( BinaryDrag< conact >::node *  n)
inline

Definition at line 42 of file find_optimal_drag.h.

◆ ReduceAndUpdateBest()

void FindOptimalDrag::ReduceAndUpdateBest ( BinaryDrag< conact t)
inline

Definition at line 57 of file find_optimal_drag.h.

Member Data Documentation

◆ best_leaves_

uint FindOptimalDrag::best_leaves_ = std::numeric_limits<uint>::max()

Definition at line 30 of file find_optimal_drag.h.

◆ best_nodes_

uint FindOptimalDrag::best_nodes_ = std::numeric_limits<uint>::max()

Definition at line 29 of file find_optimal_drag.h.

◆ best_tree_

BinaryDrag<conact> FindOptimalDrag::best_tree_

Definition at line 27 of file find_optimal_drag.h.

◆ best_tree_mutex_

std::mutex FindOptimalDrag::best_tree_mutex_

Definition at line 32 of file find_optimal_drag.h.

◆ counter_

uint FindOptimalDrag::counter_ = 0

Definition at line 28 of file find_optimal_drag.h.

◆ lma_

std::vector<BinaryDrag<conact>::node*> FindOptimalDrag::lma_

Definition at line 23 of file find_optimal_drag.h.

◆ pool_

thread_pool* FindOptimalDrag::pool_ = nullptr

Definition at line 33 of file find_optimal_drag.h.

◆ t_

BinaryDrag<conact> FindOptimalDrag::t_

Definition at line 25 of file find_optimal_drag.h.

◆ visited_

std::unordered_set<BinaryDrag<conact>::node*> FindOptimalDrag::visited_

Definition at line 24 of file find_optimal_drag.h.


The documentation for this struct was generated from the following file: