15 #ifndef PAAL_2_LOCAL_SEARCH_SOLUTION_ADAPTER_HPP
16 #define PAAL_2_LOCAL_SEARCH_SOLUTION_ADAPTER_HPP
30 typedef typename Cycle::vertex_iterator vertex_iterator;
56 auto end = m_cycle.vend();
82 #endif // PAAL_2_LOCAL_SEARCH_SOLUTION_ADAPTER_HPP
adapts cycle to have begin and end pointing to edge collection
Cycle & get_cycle()
gets adopted cycle
Iterator begin() const
Edges begin.
Iterator end() const
Edges end.
const Cycle & get_cycle() const
gets adopted cycle const version
two_local_search_adapter(Cycle &cm)
constructor
bool local_search(Solution &solution, SearchStrategy searchStrategy, ContinueOnSuccess succ, ContinueOnFail fail, components...comps)
detail
transforms collection to collection of pairs consecutive elements of the input collection. The last element and the first element are considered consecutive.
vertex_to_edge_iterator< vertex_iterator > make_vertex_to_edge_iterator(vertex_iterator b, vertex_iterator e)
make for vertex_to_edge_iterator