Search: Find Min Edges in GraphProblem (aimacode#553)

antmarakis · norvig · commit be8302f53b57 · 2017-06-16T20:06:21.000-07:00
* Update search.py

* Update test_search.py
diff --git a/search.py b/search.py
@@ -835,6 +835,15 @@ def result(self, state, action):
     def path_cost(self, cost_so_far, A, action, B):
         return cost_so_far + (self.graph.get(A, B) or infinity)
 
+    def find_min_edge(self):
+        """Find minimum value of edges."""
+        m = infinity
+        for d in self.graph.dict.values():
+            local_min = min(d.values())
+            m = min(m, local_min)
+
+        return m
+
     def h(self, node):
         """h function is straight-line distance from a node's state to goal."""
         locs = getattr(self.graph, 'locations', None)
diff --git a/tests/test_search.py b/tests/test_search.py
@@ -7,6 +7,10 @@
 LRTA_problem = OnlineSearchProblem('State_3', 'State_5', one_dim_state_space)
 
 
+def test_find_min_edge():
+    assert romania_problem.find_min_edge() == 70
+
+
 def test_breadth_first_tree_search():
     assert breadth_first_tree_search(
         romania_problem).solution() == ['Sibiu', 'Fagaras', 'Bucharest']
