This C++ program finds the shortest path between two cities, provided that the map of the two cities and the distances are provided. This program uses Stack Data Structure, Single and two dimensional arrays to store and retrieve data from files.
How to use the program?
For example, A3 Paris Marseille FranceData.txt where the first argument, ‘A3’, is the program name, the second, ‘Paris’, is the starting city, the third, ‘Marseille’, is the ending city and the fourth, ‘FranceData.txt’, is the country map file name. The city names are case sensitive.
Transform your IT and business with The Phoenix Project – the gripping story that redefines how we think about DevOps and innovation!
View on Amazon
Download the Shortest Path Program
Shortest Path (109.7 KiB, 11,972 hits)
