A python script that demonstrates different techniques in finding the quickest route to a destination on a geographical map. The script first uses Breadth First Search, then Uniform Cost Search and finally it makes use of heuristics with A* search.
The geograhical map of cities is represented as a graph of nodes with each cities connecting destinations included.
To run type python gpSearches.py