From 53cc871bbcbb8c624cf462fec763b5d4dd7edf5f Mon Sep 17 00:00:00 2001
From: Mayank17M <mamgain.mayank01@gmail.com>
Date: Sat, 11 Sep 2021 01:14:05 +0530
Subject: [PATCH] feat: Add travelling salesman problem

---
 graph/travelling_salesman_problem.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/graph/travelling_salesman_problem.cpp b/graph/travelling_salesman_problem.cpp
index 20ef6b29a..c837bacdf 100644
--- a/graph/travelling_salesman_problem.cpp
+++ b/graph/travelling_salesman_problem.cpp
@@ -22,7 +22,7 @@
 #include <iostream>         /// for IO operations
 #include <limits>           /// for limits of integral types
 #include <vector>           /// header for std::vector
-#define INT_MAX 2147483647  /// define INT_MAX
+#define max_int 2147483647  /// define INT_MAX
 
 /**
  * @namespace graph
@@ -50,7 +50,7 @@ int TravellingSalesmanProblem(std::vector<std::vector<int>> *cities, int src,
     }
 
     //// store minimum weight Hamiltonian Cycle.
-    int32_t min_path = INT_MAX;
+    int32_t min_path = max_int;
     do {
         //// store current Path weight(cost)
         int32_t curr_weight = 0;