Finding distance between two cities in USA using Artificial Intelligence

The aim of the project is to implement algorithms that find good driving directions between pairs of cities in the US given by the user. The program runs on the command line like this:
./route.py [start-city] [end-city] [routing-algorithm] [cost-function]
where:
• start-city and end-city are the cities we need a route between.
• routing-algorithm is one of:
-- bfs uses breadth-first search (which ignores edge weights in the state graph)
-- uniform is uniform cost search (the variant of bfs that takes edge weights into consideration)
-- dfs uses depth-first search
-- astar uses A* search, with a suitable heuristic function
• cost-function is one of:
– segments tries to find a route with the fewest number of “turns” (i.e. edges of the graph)
– distance tries to find a route with the shortest total distance
– time tries to find the fastest route, for a car that always travels at the speed limit