PBeFS
Parallel Best-First Search
Loading...
Searching...
No Matches
PASEOptions Struct Reference

the options of PASE More...

#include <PBeFS/astar/PASE.h>

Inheritance diagram for PASEOptions:
ParallelOptions SearchOptions ParallelParams

Public Attributes

double eps = 1
 the inflation \( \varepsilon_p \geq 1 \) of the independence rule: with \( \varepsilon_p = 1 \) the search is optimal, otherwise the cost is within a factor \( \varepsilon_p \) of the optimum
Public Attributes inherited from SearchOptions
std::size_t node_limit = 0
 stop with Status::node_limit after storing this many nodes (0 = no limit); in a parallel search the limit holds for each worker
std::size_t expected_nodes = 0
 the number of nodes the search is expected to store (0 = unknown): the closed list is sized for them at the start, instead of being doubled (and rehashed) as it fills; in a parallel search it is per worker
Public Attributes inherited from ParallelParams
unsigned threads = 1
 the number of workers
std::size_t batch = 64
 nodes packed in a message
unsigned flush_period = 64
 steps between flushes of outboxes
std::uint64_t seed = 1
 seed of the owners

Additional Inherited Members

Public Member Functions inherited from ParallelParams
void normalize (void) noexcept
 sets to 1 any parameter that is 0

Detailed Description

the options of PASE

Member Data Documentation

◆ eps

double eps = 1

the inflation \( \varepsilon_p \geq 1 \) of the independence rule: with \( \varepsilon_p = 1 \) the search is optimal, otherwise the cost is within a factor \( \varepsilon_p \) of the optimum


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