test for min_cost_path

Author: antmarakis

tests/test_dynamic_programming.py

@@ -3,7 +3,8 @@
 
 from pygorithm.dynamic_programming import (
     binary_knapsack,
-    lis
+    lis,
+    min_cost_path
     )
 
 
@@ -21,5 +22,14 @@ def test_lis(self):
         self.assertEqual(ans[0], 5)
         self.assertEqual(ans[1], [10, 22, 33, 50, 60])
 
+class TestMinCostPath(unittest.TestCase):
+    def test_min_cost_path(self):
+        matrix = [[5, 3, 10, 17, 1],
+                  [4, 2, 9, 8, 5],
+                  [11, 12, 3, 9, 6],
+                  [1, 3, 4, 2, 10],
+                  [7, 11, 13, 7, 3]]
+        self.assertEqual(min_cost_path.find_path(matrix), 38)
+
 if __name__ == '__main__':
     unittest.main()