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

feat: Add Travelling Salesman Problem

Browse Source
This commit is contained in:
Mayank17M
2021-09-10 12:52:36 +05:30
parent be341e6a57
commit e8ed350da8
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graph/travelling_salesman_problem.cpp
View File

@@ -51,10 +51,10 @@ int TravellingSalesmanProblem(std::vector<std::vector<int>> *cities, int src,
} }
//// store minimum weight Hamiltonian Cycle. //// store minimum weight Hamiltonian Cycle.
int min_path = INT_MAX; int32_t min_path = INT_MAX;
do { do {
//// store current Path weight(cost) //// store current Path weight(cost)
int curr_weight = 0; int32_t curr_weight = 0;
//// compute current path weight //// compute current path weight
int k = src; int k = src;