The objective is to find the shortest route between two cities (StarCity and GoalCity) using A* search algorithm.
Reference: https://en.wikipedia.org/wiki/A*_search_algorithm
- Execute 'script.sh' to create 'map' which is the executable file.
- Provide the input as ./map StartCity GoalCity. (The input is case sensitive)
- Input should be from cities given in FRANCE.MAP
- Cities and their distance were given in FRANCE.MAP which is the input for the traversal graph.