Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::SearchSolutionVisitor Concept Reference

Concept for callbacks invoked on each accepted solution. More...

#include <state_search_common.H>

Concept definition

template<typename Visitor, typename Solution>
concept Aleph::SearchSolutionVisitor = requires(Visitor &visitor, const Solution &solution) {
{ visitor(solution) } -> std::convertible_to<bool>;
}
Aleph::SearchSolutionVisitor
Concept for callbacks invoked on each accepted solution.
Definition state_search_common.H:370
Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Detailed Description

Concept for callbacks invoked on each accepted solution.

Template Parameters
VisitorCallable type.
SolutionExpected solution type.

Definition at line 370 of file state_search_common.H.