menu = menuInput(menuMax) while menu > 0: if menu == 1: #print the route list list.printList(cityMapInvert) elif menu == 2: #minimum spanning tree kruskalMST(numberOfCities, cityMapInvert, distPQ) elif menu == 3 or menu == 4 or menu == 5: #shortest path based on price dijkstra(numberOfCities, cityMap, pricePQ, distPQ, menu, cityMapInvert) elif menu == 6: #all trips under certain price allTrips(pricePQ, numberOfCities, list, cityMapInvert) elif menu == 7 or menu == 8: #remove or add route modifyRouteInfo(cities, cityMap, menu, cityMapInvert) list.writeFile(numberOfCities, cities, fileName) cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ = load(cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ) elif menu == 9: #subtrees subTrees(numberOfCities, cityMap, menu, cityMapInvert, cities) elif menu == 10: #add a city numberOfCities, cityMapInvert, cityMap, cities = addNewCity(numberOfCities, cityMapInvert, cityMap, cities) list.writeFile(numberOfCities, cities, fileName) cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ = load(cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ) elif menu == 11: #remove a city numberOfCities, cityMap, cityMapInvert, cities, list = removeCity(numberOfCities, cityMap, cityMapInvert, cities, list, fileName) list.writeFile(numberOfCities, cities, fileName) cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ = load(cities, cityMap, cityMapInvert, numberOfCities, fileName, list, distPQ, pricePQ) elif menu == 12: #print the menu printMenu() menu = simpleMenu(menuMax)
