backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-08 23:23:05 +08:00
Code Issues Projects Releases Wiki Activity

fix: Hopefully fix Ci errors

Browse Source
This commit is contained in:
Panquesito7
2021-09-10 21:24:21 +00:00
parent d99431cc2f
commit f44c2203cb
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
graph/travelling_salesman_problem.cpp
View File

@@ -22,7 +22,6 @@
#include <iostream> /// for IO operations
#include <limits> /// for limits of integral types
#include <vector> /// header for std::vector
#define max_int 2147483647 /// define INT_MAX
/**
* @namespace graph
@@ -50,14 +49,14 @@ int TravellingSalesmanProblem(std::vector<std::vector<int>> *cities, int src,
}
//// store minimum weight Hamiltonian Cycle.
int32_t min_path = max_int;
int32_t min_path = 2147483647;
do {
//// store current Path weight(cost)
int32_t curr_weight = 0;
//// compute current path weight
int k = src;
for (auto i = 0U; i < vtx.size(); i++) {
for (uint64_t i = 0; i < vtx.size(); i++) {
curr_weight += (*cities)[k][vtx[i]];
k = vtx[i];
}