def test_dijkstra_3(self): for g in self.graph_1s: self.assertEqual([ graph.Edge(graph.Node(1), graph.Node(2), 1), graph.Edge(graph.Node(2), graph.Node(4), 1), graph.Edge(graph.Node(4), graph.Node(5), 1) ], searches.dijkstra_search(g, graph.Node(1), graph.Node(5)))
def test_dijkstra_5(self): for g in self.graph_2s: self.assertEqual([ graph.Edge(graph.Node(0), graph.Node(6), 3), graph.Edge(graph.Node(6), graph.Node(4), 1), graph.Edge(graph.Node(4), graph.Node(5), 5) ], searches.dijkstra_search(g, graph.Node(0), graph.Node(5)))
def test_dijkstra_1(self): for g in self.graph_1s: self.assertEqual([ graph.Edge(graph.Node(1), graph.Node(3), 1), graph.Edge(graph.Node(3), graph.Node(10), 1), graph.Edge(graph.Node(10), graph.Node(8), 1) ], searches.dijkstra_search(g, graph.Node(1), graph.Node(8)))