Merge pull request aladdinpersson#33 from AladdinPerzon/AddTesting

Added a lot of test cases for many algorithms & cleaned up code on many algorithms

Author: aladdinpersson

.travis.yml

@@ -5,22 +5,54 @@ python: 3.7
 
 # Install ruby to get gem command
 before_install:
-  - sudo apt-add-repository -y ppa:brightbox/ruby-ng
-  - sudo apt-get -y update
-  - sudo apt-get -y install ruby-full
-
-#before_install:
-#    - cd Algorithm_tests/sorting_tests
-# Install awesome_bot for README.md broken link checking
+    - python --version
+    - pip install -U pip
+    - pip install -U pytest
+    - pip install codecov
+    - sudo apt-add-repository -y ppa:brightbox/ruby-ng
+    - sudo apt-get -y update
+    - sudo apt-get -y install ruby-full
 
 before_script:
-  - gem install awesome_bot
+    - gem install awesome_bot
+
+install:
+    - pip3 install -r requirements.txt
+    - pip3 install pytest
+    - pip3 install pytest-cov
+    - pip3 install codecov
+
+script: pytest --cov=Algorithm_tests/
+     # - awesome_bot README.md --allow-dupe --allow-redirect
+     # # Dynamic Programming Tests
+     # - python Algorithm_tests/dynamic_programming_tests/knapsack_tests/knapsack_bottomup_test.py
+     # - python Algorithm_tests/dynamic_programming_tests/sequence_alignment/sequence_alignment_test.py
+     # - python Algorithm_tests/dynamic_programming_tests/weighted_interval_scheduling/weighted_interval_scheduling_test.py
+     #
+     # # Graph Theory Tests
+     # - python Algorithm_tests/graphtheory_tests/bellman_ford_test.py
+     # - python Algorithm_tests/graphtheory_tests/kahn_topological_ordering_test.py
+     # - python Algorithm_tests/graphtheory_tests/Djikstra/djikstra_heap_test.py
+     # - python Algorithm_tests/graphtheory_tests/Djikstra/djikstra_naive_test.py
+     # - python Algorithm_tests/graphtheory_tests/kruskal_unionfind_test.py
+     # - python Algorithm_tests/graphtheory_tests/prims_algorithm_test.py
+     # - python Algorithm_tests/graphtheory_tests/BFS_test.py
+     # - python Algorithm_tests/graphtheory_tests/DFS_test.py
+     #
+     # # Math tests
+     # - python Algorithm_tests/other_tests/test_binarysearch.py
+     # - python Algorithm_tests/math_tests/intersection_test.py
+     # - python Algorithm_tests/math_tests/union_test.py
+     #
+     # # Cryptography tests
+     # - python Algorithm_tests/cryptology_tests/ceasar_test.py
+     #
+     # # "Other" tests
+     # - python Algorithm_tests/other_tests/test_medianmaintenance.py
+     # - python Algorithm_tests/other_tests/test_intervalscheduling.py
+     #
+     # # Sorting tests
+     # - python Algorithm_tests/sorting_tests/test_sorting.py
 
-script:
-     - awesome_bot README.md --allow-dupe --allow-redirect
-     - python Algorithm_tests/sorting_tests/test_sorting.py
-     - python Algorithm_tests/graphtheory_tests/bellman_ford_test.py
-     - python Algorithm_tests/search_tests/test_binarysearch.py
-     - python Algorithm_tests/math_tests/intersection_test.py
-     - python Algorithm_tests/math_tests/union_test.py
-     - python Algorithm_tests/cryptology_tests/ceasar_test.py
+after_success:
+    - codecov

Algorithm_tests/dynamic_programming_tests/knapsack_tests/knapsack_bottomup_test.py

@@ -0,0 +1,61 @@
+import sys
+import unittest
+
+# For importing from different folders
+# OBS: This is supposed to be done with automated testing, hence relative to folder we want to import from
+sys.path.append('Algorithms/dynamic_programming/knapsack')
+
+# If run from local:
+#sys.path.append('../../../Algorithms/dynamic_programming/knapsack/')
+from knapsack_bottomup import knapsack
+
+class test_KnapSack(unittest.TestCase):
+    def setUp(self):
+        self.weights1, self.values1, self.capacity1 = [], [], 100
+        self.n1 = len(self.weights1)
+        self.correctvalue1, self.correctitems1 = 0, []
+
+        self.weights2, self.values2, self.capacity2 = [10], [50], 100
+        self.n2 = len(self.weights2)
+        self.correctvalue2, self.correctitems2 = 50, [0]
+
+        self.weights3, self.values3, self.capacity3 = [10, 20, 30], [-10, -20, -30], 100
+        self.n3 = len(self.weights2)
+        self.correctvalue3, self.correctitems3 = 0, []
+
+        self.weights4, self.values4, self.capacity4 = [1, 2, 4, 2, 5], [5, 3, 5, 3, 2], 5
+        self.n4 = len(self.weights4)
+        self.correctvalue4, self.correctitems4 = 11, [0, 1, 3]
+
+        self.weights5, self.values5, self.capacity5 = [10, 10, 10], [30, 30, 30], 5
+        self.n5 = len(self.weights5)
+        self.correctvalue5, self.correctitems5 = 0, []
+
+    def test_noitems(self):
+        total_value, items = knapsack(self.n1, self.capacity1, self.weights1, self.values1)
+        self.assertEqual(self.correctvalue1, total_value)
+        self.assertEqual(self.correctitems1, items)
+
+    def test_singleitem_value(self):
+        total_value, items = knapsack(self.n2, self.capacity2, self.weights2, self.values2)
+        self.assertEqual(self.correctvalue2, total_value)
+        self.assertEqual(self.correctitems2, items)
+
+    def test_negativevalues(self):
+        total_value, items = knapsack(self.n3, self.capacity3, self.weights3, self.values3)
+        self.assertEqual(self.correctvalue3, total_value)
+        self.assertEqual(self.correctitems3, items)
+
+    def test_simpleexample(self):
+        total_value, items = knapsack(self.n4, self.capacity4, self.weights4, self.values4)
+        self.assertEqual(self.correctvalue4, total_value)
+        self.assertEqual(self.correctitems4, items)
+
+    def test_weight_too_heavy(self):
+        total_value, items = knapsack(self.n5, self.capacity5, self.weights5, self.values5)
+        self.assertEqual(self.correctvalue5, total_value)
+        self.assertEqual(self.correctitems5, items)
+
+if __name__ == '__main__':
+    print("Running Knapsack tests:")
+    unittest.main()

Algorithm_tests/dynamic_programming_tests/knapsack_tests/knapsack_tests.py

@@ -0,0 +1,115 @@
+import sys
+import unittest
+
+# For importing from different folders
+# OBS: This is supposed to be done with automated testing, hence relative to folder we want to import from
+sys.path.append('Algorithms/dynamic_programming/')
+
+# If run from local:
+#sys.path.append('../../../Algorithms/dynamic_programming/')
+from sequence_alignment import SequenceAlignment
+
+class test_sequence_alignment(unittest.TestCase):
+    def setUp(self):
+        self.x1 = 'ABC'
+        self.y1 = 'ADC'
+        self.correct_editstep1 = 1
+
+        self.x2 = 'AB'
+        self.y2 = 'A'
+        self.correct_editstep2 = 1
+
+        self.x3 = 'A'
+        self.y3 = ''
+        self.correct_editstep3 = 1
+
+        self.x4 = 'ABC'
+        self.y4 = 'ABCDE'
+        self.correct_editstep4 = 2
+
+        self.x5 = 'ABCKL'
+        self.y5 = 'ADCE'
+        self.correct_editstep5 = 3
+
+        self.x6 = 'A'*10
+        self.y6 = ''
+        self.correct_editstep6 = 10
+
+        self.x7 = ''
+        self.y7 = 'A' * 10
+        self.correct_editstep7 = 10
+
+        self.x8 = 'TGACGTGC'
+        self.y8 = 'TCGACGTCA'
+        self.correct_editstep8 = 3
+
+        self.x9 = 'XYZ'
+        self.y9 = 'XKZ'
+        self.correct_solution9 = ['align_X', 'align_K', 'align_Z']
+
+        self.x10 = 'XX'
+        self.y10 = ''
+        self.correct_solution10 = ['remove_X', 'remove_X']
+
+        self.x11 = ''
+        self.y11 = 'XX'
+        self.correct_solution11 = ['insert_X', 'insert_X']
+
+    def test_simplecase(self):
+        sequence_align = SequenceAlignment(self.x1, self.y1)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep1, editsteps)
+
+    def test_remove(self):
+        sequence_align = SequenceAlignment(self.x2, self.y2)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep2, editsteps)
+
+    def test_remove_to_empty(self):
+        sequence_align = SequenceAlignment(self.x3, self.y3)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep3, editsteps)
+
+    def test_insert_elements(self):
+        sequence_align = SequenceAlignment(self.x4, self.y4)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep4, editsteps)
+
+    def test_remove_insert_align(self):
+        sequence_align = SequenceAlignment(self.x5, self.y5)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep5, editsteps)
+
+    def test_x_longer_than_y(self):
+        sequence_align = SequenceAlignment(self.x6, self.y6)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep6, editsteps)
+
+    def test_y_longer_than_x(self):
+        sequence_align = SequenceAlignment(self.x7, self.y7)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep7, editsteps)
+
+    def test_more_complicated_example(self):
+        sequence_align = SequenceAlignment(self.x8, self.y8)
+        editsteps, _ = sequence_align.alignment()
+        self.assertEqual(self.correct_editstep8, editsteps)
+
+    def test_findsolution_simplecase(self):
+        sequence_align = SequenceAlignment(self.x9, self.y9)
+        _, solution = sequence_align.alignment()
+        self.assertEqual(self.correct_solution9, solution)
+
+    def test_findsolution_empty_y(self):
+        sequence_align = SequenceAlignment(self.x10, self.y10)
+        _, solution = sequence_align.alignment()
+        self.assertEqual(self.correct_solution10, solution)
+
+    def test_findsolution_empty_x(self):
+        sequence_align = SequenceAlignment(self.x11, self.y11)
+        _, solution = sequence_align.alignment()
+        self.assertEqual(self.correct_solution11, solution)
+
+if __name__ == '__main__':
+    print("Running Sequence Alignment tests:")
+    unittest.main()