summaryrefslogtreecommitdiff
path: root/tests
diff options
context:
space:
mode:
authorHaidong Ji2021-07-05 15:30:18 -0500
committerHaidong Ji2021-07-05 15:30:18 -0500
commit578f8f5874e66a35660eb0759ef7d90a27fbcffe (patch)
treedcc51682d315c94c8db3c0346ea3ed0799034fc4 /tests
parent4fd3e8a8f86838720fe43632ce9b06d3d2edaa23 (diff)
Dijkstra shortest path done, using heapq.
Pretty simple after I first implemented in Java.
Diffstat (limited to 'tests')
-rw-r--r--tests/test_reachability.py6
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()