Added testing for python and ruby

Author: mburst

dijkstras.py

@@ -19,8 +19,8 @@ def shortest_path(self, start, finish):
                 distances[vertex] = 0
                 heapq.heappush(nodes, [0, vertex])
             else:
-                distances[vertex] = sys.maxint
-                heapq.heappush(nodes, [sys.maxint, vertex])
+                distances[vertex] = sys.maxsize
+                heapq.heappush(nodes, [sys.maxsize, vertex])
             previous[vertex] = None
 
         while nodes:
@@ -31,7 +31,7 @@ def shortest_path(self, start, finish):
                     path.append(smallest)
                     smallest = previous[smallest]
                 return path
-            if distances[smallest] == sys.maxint: # All remaining vertices are inaccessible from source
+            if distances[smallest] == sys.maxsize: # All remaining vertices are inaccessible from source
                 break
 
             for neighbor in self.vertices[smallest]: # Look at all the nodes that this vertex is attached to
@@ -48,14 +48,15 @@ def shortest_path(self, start, finish):
 
     def __str__(self):
         return str(self.vertices)
-        
-g = Graph()
-g.add_vertex('A', {'B': 7, 'C': 8})
-g.add_vertex('B', {'A': 7, 'F': 2})
-g.add_vertex('C', {'A': 8, 'F': 6, 'G': 4})
-g.add_vertex('D', {'F': 8})
-g.add_vertex('E', {'H': 1})
-g.add_vertex('F', {'B': 2, 'C': 6, 'D': 8, 'G': 9, 'H': 3})
-g.add_vertex('G', {'C': 4, 'F': 9})
-g.add_vertex('H', {'E': 1, 'F': 3})
-print g.shortest_path('A', 'H')
+
+if __name__ == '__main__':
+    g = Graph()
+    g.add_vertex('A', {'B': 7, 'C': 8})
+    g.add_vertex('B', {'A': 7, 'F': 2})
+    g.add_vertex('C', {'A': 8, 'F': 6, 'G': 4})
+    g.add_vertex('D', {'F': 8})
+    g.add_vertex('E', {'H': 1})
+    g.add_vertex('F', {'B': 2, 'C': 6, 'D': 8, 'G': 9, 'H': 3})
+    g.add_vertex('G', {'C': 4, 'F': 9})
+    g.add_vertex('H', {'E': 1, 'F': 3})
+    print(g.shortest_path('A', 'H'))

dijkstras.rb

@@ -51,21 +51,23 @@ def shortest_path(start, finish)
                 end
             end
         end
-        return distances.inspect
+        return distances
     end
 
     def to_s
         return @vertices.inspect
     end
 end
 
-g = Graph.new
-g.add_vertex('A', {'B' => 7, 'C' => 8})
-g.add_vertex('B', {'A' => 7, 'F' => 2})
-g.add_vertex('C', {'A' => 8, 'F' => 6, 'G' => 4})
-g.add_vertex('D', {'F' => 8})
-g.add_vertex('E', {'H' => 1})
-g.add_vertex('F', {'B' => 2, 'C' => 6, 'D' => 8, 'G' => 9, 'H' => 3})
-g.add_vertex('G', {'C' => 4, 'F' => 9})
-g.add_vertex('H', {'E' => 1, 'F' => 3})
-puts g.shortest_path('A', 'H')
+if __FILE__ == $0
+    g = Graph.new
+    g.add_vertex('A', {'B' => 7, 'C' => 8})
+    g.add_vertex('B', {'A' => 7, 'F' => 2})
+    g.add_vertex('C', {'A' => 8, 'F' => 6, 'G' => 4})
+    g.add_vertex('D', {'F' => 8})
+    g.add_vertex('E', {'H' => 1})
+    g.add_vertex('F', {'B' => 2, 'C' => 6, 'D' => 8, 'G' => 9, 'H' => 3})
+    g.add_vertex('G', {'C' => 4, 'F' => 9})
+    g.add_vertex('H', {'E' => 1, 'F' => 3})
+    puts g.shortest_path('A', 'H')
+end

dijkstras_test.py

@@ -0,0 +1,27 @@
+import unittest
+from dijkstras import Graph
+
+class Graph_Test(unittest.TestCase):
+    
+    #Runs before each test
+    def setUp(self):
+        self.graph = Graph()
+    
+    def test_add_vertex(self):
+        self.graph.add_vertex('A', {'B': 7, 'C': 8})
+        self.assertEqual(self.graph.vertices, {'A': {'C': 8, 'B': 7}})
+        
+    def test_shortest_path(self, ):
+        self.graph.add_vertex('A', {'B': 7, 'C': 8})
+        self.graph.add_vertex('B', {'A': 7, 'F': 2})
+        self.graph.add_vertex('C', {'A': 8, 'F': 6, 'G': 4})
+        self.graph.add_vertex('D', {'F': 8})
+        self.graph.add_vertex('E', {'H': 1})
+        self.graph.add_vertex('F', {'B': 2, 'C': 6, 'D': 8, 'G': 9, 'H': 3})
+        self.graph.add_vertex('G', {'C': 4, 'F': 9})
+        self.graph.add_vertex('H', {'E': 1, 'F': 3})
+        
+        self.assertEqual(self.graph.shortest_path('A', 'H'), ['H', 'F', 'B'])
+        self.assertEqual(self.graph.shortest_path('H', 'I'), {'A': 12, 'B': 5, 'C': 9, 'D': 11, 'E': 1, 'F': 3, 'G': 12, 'H': 0})
+
+unittest.main()

dijkstras_test.rb

@@ -0,0 +1,29 @@
+require 'test/unit'
+require_relative 'dijkstras'
+
+class Graph_Test < Test::Unit::TestCase
+    
+    #Runs before each test
+    def setup
+        @graph = Graph.new
+    end
+    
+    def test_add_vertex
+        @graph.add_vertex('A', {'B' => 7, 'C' => 8})
+        assert_equal({"A"=>{"B"=>7, "C"=>8}}, @graph.instance_variable_get(:@vertices), "Failed to add vertex")
+    end
+    
+    def test_shortest_path
+        @graph.add_vertex('A', {'B' => 7, 'C' => 8})
+        @graph.add_vertex('B', {'A' => 7, 'F' => 2})
+        @graph.add_vertex('C', {'A' => 8, 'F' => 6, 'G' => 4})
+        @graph.add_vertex('D', {'F' => 8})
+        @graph.add_vertex('E', {'H' => 1})
+        @graph.add_vertex('F', {'B' => 2, 'C' => 6, 'D' => 8, 'G' => 9, 'H' => 3})
+        @graph.add_vertex('G', {'C' => 4, 'F' => 9})
+        @graph.add_vertex('H', {'E' => 1, 'F' => 3})
+        
+        assert_equal(['H', 'F', 'B'], @graph.shortest_path('A', 'H'), 'Failed to find shortest path')
+        assert_equal({'A' => 12, 'B' => 5, 'C' => 9, 'D' => 11, 'E' => 1, 'F' => 3, 'G' => 12, 'H' => 0}, @graph.shortest_path('H', 'I'), 'Failed to find shortest paths from root node')
+    end
+end