Function to find the minimum cost path for all the paths
static void findMinRoute ( int [ , ] tsp ) { int sum = 0 ; int counter = 0 ; int j = 0 , i = 0 ; int min = int . MaxValue ; List < int > visitedRouteList = new List < int > ( ) ;