>>> fileref = open(pickAFile(), 'r')
>>> g = buildGraph(fileref)
>>> g
{'Atlanta': {'Dallas': 33, 'Chicago': 15, 'Seattle': 52}, 'Dallas': {'Atlanta': 33, 'Boston': 10, 'Seattle': 12}, 
'Boston': {'Dallas': 10, 'Seattle': 45, 'Minneapolis': 65}, 'Chicago': {'Atlanta': 15, 'Seattle': 34, 'Minneapolis': 12}, 
'Seattle': {'Atlanta': 52, 'Boston': 45, 'Dallas': 12, 'Chicago': 34}, 'Minneapolis': {'Boston': 65, 'Chicago': 12}}
>>> breadthFirstSearch(g, 'Atlanta')
[{'Atlanta': 0, 'Boston': 2, 'Dallas': 1, 'Chicago': 1, 'Seattle': 1, 'Minneapolis': 2}, 
{'Atlanta': 'Atlanta', 'Boston': 'Dallas', 'Dallas': 'Atlanta', 'Chicago': 'Atlanta', 'Seattle': 'Atlanta', 'Minneapolis': 'Chicago'}]
>>> DijkstraShortestPath(g,  'Atlanta')
[{'Atlanta': 0, 'Boston': 43, 'Dallas': 33, 'Chicago': 15, 'Seattle': 45, 'Minneapolis': 27}, 
{'Atlanta': 'Atlanta', 'Boston': 'Dallas', 'Dallas': 'Atlanta', 'Chicago': 'Atlanta', 'Seattle': 'Dallas', 'Minneapolis': 'Chicago'}]