Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::BranchAndBoundStats Struct Reference

Branch-and-bound specific statistics. More...

#include <Branch_And_Bound.H>

Inheritance diagram for Aleph::BranchAndBoundStats:
[legend]
Collaboration diagram for Aleph::BranchAndBoundStats:
[legend]

Public Attributes

size_t pruned_by_bound = 0
 Nodes pruned because their bound cannot beat the incumbent.
 
size_t incumbent_updates = 0
 Number of times the incumbent improved.
 
- Public Attributes inherited from Aleph::SearchStats
size_t visited_states = 0
 Number of states entered by the engine.
 
size_t expanded_states = 0
 Number of non-terminal states expanded.
 
size_t generated_successors = 0
 Number of successor moves emitted.
 
size_t solutions_found = 0
 Number of goal states accepted.
 
size_t terminal_states = 0
 Non-solution terminal states cut by the domain.
 
size_t pruned_by_depth = 0
 States not expanded due to max depth.
 
size_t pruned_by_domain = 0
 States discarded by domain-side pruning.
 
size_t pruned_by_visited = 0
 States skipped because already seen (visited-set duplicate suppression).
 
size_t limit_hits = 0
 Number of hard-limit stops triggered.
 
size_t max_depth_reached = 0
 Deepest path depth visited.
 
double elapsed_ms = 0.0
 Wall-clock time spent inside the search call.
 
MoveOrderingStats move_ordering
 Successor-ordering activity for this run.
 

Detailed Description

Branch-and-bound specific statistics.

Definition at line 202 of file Branch_And_Bound.H.

Member Data Documentation

◆ incumbent_updates

size_t Aleph::BranchAndBoundStats::incumbent_updates = 0

Number of times the incumbent improved.

Definition at line 205 of file Branch_And_Bound.H.

Referenced by Aleph::Branch_And_Bound< Domain, ObjectivePolicy >::handle_complete_solution().

◆ pruned_by_bound


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