Aleph::IDAStarResult< Solution, Distance > Struct Template Reference

Aggregated result of a complete IDA* run. More...

#include <State_Search_IDA_Star.H>

Inheritance diagram for Aleph::IDAStarResult< Solution, Distance >:

Collaboration diagram for Aleph::IDAStarResult< Solution, Distance >:

Public Types
using	Base = SearchResult< Solution >
using	Distance_Type = Distance
Public Types inherited from Aleph::SearchResult< Solution, Compare >
using	Solution_Type = Solution
	Type of solutions in this result.
using	Compare_Type = Compare
	Type of the comparison policy.
using	Incumbent_Type = BestSolution< Solution, Compare >
	Concrete incumbent type.

Public Member Functions
	IDAStarResult ()=default
Public Member Functions inherited from Aleph::SearchResult< Solution, Compare >
	SearchResult ()=default
	Build an empty result.
	SearchResult (Compare compare)
	Build a result with a specific solution comparator.
bool	found_solution () const noexcept
	Return true if at least one solution was retained.
bool	exhausted () const noexcept
	Return true if the search exhausted the configured region.
bool	stopped_on_solution () const noexcept
	Return true if search stopped because solution handling requested it.
bool	limit_reached () const noexcept
	Return true if a hard search limit stopped the traversal.

Public Attributes
Distance	total_cost = Distance{}
	Optimal path cost (valid when found_solution()).
Array< IDAStarIteration< Distance > >	iterations
	One entry per completed threshold pass.
Public Attributes inherited from Aleph::SearchResult< Solution, Compare >
SearchStatus	status = SearchStatus::NotStarted
	Final execution state.
ExplorationPolicy	policy
	Exploration policy used for the run.
SearchLimits	limits
	Limits used for the run.
SearchStats	stats
	Statistics collected during the run.
Incumbent_Type	best_solution
	Best incumbent retained by the engine.

Detailed Description

template<typename Solution, typename Distance>
struct Aleph::IDAStarResult< Solution, Distance >

Aggregated result of a complete IDA* run.

Extends SearchResult with per-iteration data and the total optimal cost once a solution is found.

Template Parameters

Solution	solution snapshot type (see SearchSolution).
Distance	numeric cost type from the domain.

Definition at line 103 of file State_Search_IDA_Star.H.

Member Typedef Documentation

Base

template<typename Solution , typename Distance >

using Aleph::IDAStarResult< Solution, Distance >::Base = SearchResult<Solution>

Definition at line 105 of file State_Search_IDA_Star.H.

Distance_Type

template<typename Solution , typename Distance >

using Aleph::IDAStarResult< Solution, Distance >::Distance_Type = Distance

Definition at line 106 of file State_Search_IDA_Star.H.

Constructor & Destructor Documentation

IDAStarResult()

template<typename Solution , typename Distance >

Aleph::IDAStarResult< Solution, Distance >::IDAStarResult ( )

default

Member Data Documentation

iterations

template<typename Solution , typename Distance >

Array<IDAStarIteration<Distance> > Aleph::IDAStarResult< Solution, Distance >::iterations

One entry per completed threshold pass.

Definition at line 109 of file State_Search_IDA_Star.H.

total_cost

template<typename Solution , typename Distance >

Distance Aleph::IDAStarResult< Solution, Distance >::total_cost = Distance{}

Optimal path cost (valid when found_solution()).

Definition at line 108 of file State_Search_IDA_Star.H.

Referenced by Aleph::ida_star_detail::dfs().

---

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

• State_Search_IDA_Star.H