Dijkstra shortest path done, using heapq.

Pretty simple after I first implemented in Java.

1 files changed, 3 insertions, 3 deletions

diff --git a/tests/test_reachability.py b/tests/test_reachability.py
index 318309b..8908c30 100644
--- a/tests/test_reachability.py
+++ b/tests/test_reachability.py
@@ -5,10 +5,10 @@ from sources.reachability import reach
 class TestReachability(unittest.TestCase):
 
     def testName(self):
-        adj = [[1, 3],[], [1],[2]]
+        adj = [[1, 3], [], [1], [2]]
         self.assertEqual(1, reach(adj, 0, 3))
 
 
 if __name__ == "__main__":
-    #import sys;sys.argv = ['', 'Test.testName']
-    unittest.main()
\ No newline at end of file
+    # import sys;sys.argv = ['', 'Test.testName']
+    unittest.main()