|
PBeFS
Parallel Best-First Search
|
a path from the initial state to a goal, and its cost More...
#include <PBeFS/astar/Solution.h>
Public Member Functions | |
| bool | solved (void) const noexcept |
| true if a path has been found | |
Public Attributes | |
| Status | status = Status::unsolvable |
| how the search ended | |
| Cost | cost {} |
| the cost of the path | |
| std::vector< State > | path |
| the states along the path | |
| SearchStats | stats |
| the counters of the search | |
a path from the initial state to a goal, and its cost
path.front() is the initial state and path.back() the goal; the path is empty unless status == Status::solved.
|
inlinenodiscardnoexcept |
true if a path has been found
| Cost cost {} |
the cost of the path
| std::vector< State > path |
the states along the path
| SearchStats stats |
the counters of the search
| Status status = Status::unsolvable |
how the search ended