def solve(self, time_bound=-1, verbose=True, random_seed=0):
if self._dis is not None:
res = _CCtsp_solve_sparse(self._ncount, self._dis, "name",
time_bound)
else:
res = _CCtsp_solve_dat(self._ncount, self._data, "TSP_Concorde",
time_bound, not verbose, random_seed)
return ComputedTour(*res)
def test_solve_berlin_normal(self):
# Given
fname = get_dataset_path('berlin52')
expected_tour, expected_opt_value = get_solution_data('berlin52')
ncount, datagroup = _CCutil_gettsplib(fname)
# When
tour, val, success, foundtour, timebound = \
_CCtsp_solve_dat(ncount, datagroup, "berlin", 0, 0)
# Then
nptest.assert_array_equal(tour, expected_tour)
self.assertAlmostEqual(val, expected_opt_value)
self.assertTrue(success)
self.assertTrue(foundtour)
def solve(self, time_bound=-1, verbose=True, random_seed=0):
name = str(uuid.uuid4().hex)[0:9]
res = _CCtsp_solve_dat(self._ncount, self._data, name, time_bound,
not verbose, random_seed)
return ComputedTour(*res)
def solve(self, time_bound=-1, verbose=True, random_seed=0):
res = _CCtsp_solve_dat(
self._ncount, self._data, "name",
time_bound, not verbose, random_seed
)
return ComputedTour(*res)