dejavu::search_strategy::bfs_ir Class Reference

Breadth-first search. More...

#include <bfs.h>

Public Member Functions
	bfs_ir (timed_print &printer, groups::automorphism_workspace &automorphism)
void	do_a_level (sgraph *g, dejavu_hook *hook, ir::shared_tree &ir_tree, ir::controller &local_state, std::function< ir::type_selector_hook > *selector)
void	compute_node (sgraph *g, dejavu_hook *hook, ir::shared_tree *ir_tree, ir::controller &local_state, ir::tree_node *node, const int v, ir::limited_save *last_load)
void	work_on_todo (sgraph *g, dejavu_hook *hook, ir::shared_tree *ir_tree, ir::controller &local_state)

Static Public Member Functions
static int	next_level_estimate (ir::shared_tree &ir_tree, std::function< ir::type_selector_hook > *selector)
static void	queue_up_level (std::function< ir::type_selector_hook > *selector, ir::shared_tree &ir_tree, int base_pos)

Public Attributes
bool	h_use_deviation_pruning = true
int	s_total_prune = 0
int	s_total_kept = 0
int	s_total_automorphism_prune = 0
int	s_total_leaves = 0
int	s_deviation_prune = 0

Detailed Description

Breadth-first search.

Definition at line 16 of file bfs.h.

Constructor & Destructor Documentation

bfs_ir()

dejavu::search_strategy::bfs_ir::bfs_ir ( timed_print &  printer, groups::automorphism_workspace &  automorphism  )

inline

Definition at line 31 of file bfs.h.

Member Function Documentation

compute_node()

void dejavu::search_strategy::bfs_ir::compute_node ( sgraph *  g, dejavu_hook *  hook, ir::shared_tree *  ir_tree, ir::controller &  local_state, ir::tree_node *  node, const int  v, ir::limited_save *  last_load  )

inline

Definition at line 97 of file bfs.h.

do_a_level()

void dejavu::search_strategy::bfs_ir::do_a_level ( sgraph *  g, dejavu_hook *  hook, ir::shared_tree &  ir_tree, ir::controller &  local_state, std::function< ir::type_selector_hook > *  selector  )

inline

Definition at line 34 of file bfs.h.

next_level_estimate()

static int dejavu::search_strategy::bfs_ir::next_level_estimate ( ir::shared_tree &  ir_tree, std::function< ir::type_selector_hook > *  selector  )

inlinestatic

Definition at line 51 of file bfs.h.

queue_up_level()

static void dejavu::search_strategy::bfs_ir::queue_up_level ( std::function< ir::type_selector_hook > *  selector, ir::shared_tree &  ir_tree, int  base_pos  )

inlinestatic

Definition at line 63 of file bfs.h.

work_on_todo()

void dejavu::search_strategy::bfs_ir::work_on_todo ( sgraph *  g, dejavu_hook *  hook, ir::shared_tree *  ir_tree, ir::controller &  local_state  )

inline

Definition at line 232 of file bfs.h.

Member Data Documentation

h_use_deviation_pruning

bool dejavu::search_strategy::bfs_ir::h_use_deviation_pruning = true

use pruning using deviation maps

Definition at line 21 of file bfs.h.

s_deviation_prune

int dejavu::search_strategy::bfs_ir::s_deviation_prune = 0

how many nodes were pruned using deviation maps

Definition at line 29 of file bfs.h.

s_total_automorphism_prune

int dejavu::search_strategy::bfs_ir::s_total_automorphism_prune = 0

how many nodes were pruned using automorphism pruning

Definition at line 27 of file bfs.h.

s_total_kept

int dejavu::search_strategy::bfs_ir::s_total_kept = 0

how many nodes were kept, i.e., not pruned

Definition at line 26 of file bfs.h.

s_total_leaves

int dejavu::search_strategy::bfs_ir::s_total_leaves = 0

how many of the computed nodes were leaves

Definition at line 28 of file bfs.h.

s_total_prune

int dejavu::search_strategy::bfs_ir::s_total_prune = 0

how many nodes were pruned on last level

Definition at line 25 of file bfs.h.

---

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

• bfs.h