PBeFS
Parallel Best-First Search
Loading...
Searching...
No Matches
Solution< State, Cost > Struct Template Reference

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

Detailed Description

template<class State, class Cost>
struct PBeFS_di_unipi_it::Solution< State, Cost >

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.

Member Function Documentation

◆ solved()

template<class State, class Cost>
bool solved ( void ) const
inlinenodiscardnoexcept

true if a path has been found

Member Data Documentation

◆ cost

template<class State, class Cost>
Cost cost {}

the cost of the path

◆ path

template<class State, class Cost>
std::vector< State > path

the states along the path

◆ stats

template<class State, class Cost>
SearchStats stats

the counters of the search

◆ status

template<class State, class Cost>
Status status = Status::unsolvable

how the search ended


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