16 #include "test/test_utils/sample_graph.hpp"
31 typedef sample_graphs_metrics SGM;
32 auto gm = SGM::get_graph_metric_small();
33 const int size = gm.size();
34 std::cout << size << std::endl;
35 std::vector<int> v(size);
36 std::iota(v.begin(), v.end(), 0);
39 std::random_shuffle(v.begin(), v.end());
41 Cycle cycle(v.begin(), v.end());
This is the simplest implementation of the Cycle concept based on the list.
auto get_default_two_local_components(const Metric &m)
get default two local search components
Metric::DistanceType get_cycle_length(const Metric &m, const Cycle &cm)
computes length of the cycle
bool local_search(Solution &solution, SearchStrategy searchStrategy, ContinueOnSuccess succ, ContinueOnFail fail, components...comps)
detail
bool tsp_first_improving(Cycle &cycle, components...comps)
simple version of two_local_search