def test_dijkstra(self):
# Example from https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
g = Graph()
g.addEdge(1, 2, 7)
g.addEdge(1, 3, 9)
g.addEdge(2, 3, 10)
g.addEdge(1, 6, 14)
g.addEdge(2, 4, 15)
g.addEdge(3, 6, 2)
g.addEdge(3, 4, 11)
g.addEdge(4, 5, 6)
g.addEdge(5, 6, 9)
dist = g.bestPath_Dijkstra(1, 5)
self.assertEqual(20, dist)
