def main():
# Create an instance of TSP
p = TSP.createProblem() # 'p': (numCities, locations, table)
# Call the search algorithm
solution, minimum = steepestAscent(p)
# Show the problem and algorithm settings
TSP.describeProblem(p)
TSP.displaySetting("Steepst-Ascent")
# Report results
TSP.displayResult(solution, minimum)
def main():
# Create an instance of TSP
p = TSP.createProblem() # 'p': (numCities, locations, distanceTable)
# Call the search algorithm
solution, minimum = firstChoice(p)
# Show the problem and algorithm settings
TSP.describeProblem(p)
TSP.displaySetting("First-Choice")
# Report results
TSP.displayResult(solution, minimum)