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

Concept for a set suitable for tracking globally visited states. More...

#include <state_search_common.H>

Concept definition

template<typename Set, typename Key>
concept Aleph::VisitedStateSet = requires(Set &set, const Key &key) {
{ set.contains(key) } -> std::convertible_to<bool>;
set.insert(key);
}
Aleph::VisitedStateSet
Concept for a set suitable for tracking globally visited states.
Definition state_search_common.H:143
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 a set suitable for tracking globally visited states.

Compatible with Aleph::SearchStorageSet and the Aleph DynHashSet family. The engine uses contains(key) to check for prior visits and insert(key) to record a new one. Inserting an already-present key must be a no-op.

Template Parameters
SetContainer type.
KeyState key type.

Definition at line 143 of file state_search_common.H.