DDDAStar< D > Class Template Reference

the A* search of a Domain with delayed duplicate detection on the disk More...

#include <PBeFS/astar/DDDAStar.h>

Public Types
using	State = state_t< D >
	the state type
using	Cost = cost_t< D >
	the cost type
using	SolutionT = Solution< State , Cost >
	the solution type

Public Member Functions
	DDDAStar (const D &domain, const SearchOptions &options={}, DDDOptions ddd={})
	constructor, taking the Domain (which must outlive the DDDAStar)
SolutionT	solve (void) const
	searches the Domain, returning the Solution

Detailed Description

template<DiskDomain D>
class PBeFS_di_unipi_it::DDDAStar< D >

the A* search of a Domain with delayed duplicate detection on the disk

The counters of the Solution: expanded counts the states expanded, each once, generated the successors, duplicates the copies dropped (within a file and against the closed files), and stored the states written to the closed files, i.e., the distinct states expanded. The node_limit of the SearchOptions bounds stored, and the search stops with Status::node_limit when it reaches it; expected_nodes is not used.

Member Typedef Documentation

Cost

template<DiskDomain D>

using Cost = cost_t< D >

the cost type

SolutionT

template<DiskDomain D>

using SolutionT = Solution< State , Cost >

the solution type

State

template<DiskDomain D>

using State = state_t< D >

the state type

Constructor & Destructor Documentation

DDDAStar()

template<DiskDomain D>

DDDAStar ( const D & domain, const SearchOptions & options = {}, DDDOptions ddd = {} )

inlineexplicit

constructor, taking the Domain (which must outlive the DDDAStar)

Member Function Documentation

solve()

template<DiskDomain D>

SolutionT solve ( void ) const

inlinenodiscard

searches the Domain, returning the Solution

---

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

• PBeFS/astar/DDDAStar.h