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

the options shared by all the searches More...

#include <PBeFS/astar/Solution.h>

Inheritance diagram for SearchOptions:
ParallelOptions PASEOptions PBNFOptions

Public Attributes

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

Detailed Description

the options shared by all the searches

Member Data Documentation

◆ expected_nodes

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

◆ node_limit

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


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