|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Default incumbent ordering for DFS solutions. More...
#include <Backtracking.H>
Public Member Functions | |
| bool | operator() (const SearchSolution< State, Move > &lhs, const SearchSolution< State, Move > &rhs) const noexcept |
Default incumbent ordering for DFS solutions.
The first criterion is minimum depth. Ties keep the earlier incumbent.
Definition at line 64 of file Backtracking.H.
|
inlinenoexcept |
Definition at line 66 of file Backtracking.H.
References Aleph::divide_and_conquer_partition_dp().