fixes

Author: itsvinayak

ciphers/affine_cipher.py

@@ -33,18 +33,15 @@ def check_keys(keyA, keyB, mode):
     if mode == "encrypt":
         if keyA == 1:
             sys.exit(
-                "The affine cipher becomes weak when key "
-                "A is set to 1. Choose different key"
+                "The affine cipher becomes weak when key " "A is set to 1. Choose different key"
             )
         if keyB == 0:
             sys.exit(
-                "The affine cipher becomes weak when key "
-                "B is set to 0. Choose different key"
+                "The affine cipher becomes weak when key " "B is set to 0. Choose different key"
             )
     if keyA < 0 or keyB < 0 or keyB > len(SYMBOLS) - 1:
         sys.exit(
-            "Key A must be greater than 0 and key B must "
-            f"be between 0 and {len(SYMBOLS) - 1}."
+            "Key A must be greater than 0 and key B must " f"be between 0 and {len(SYMBOLS) - 1}."
         )
     if cryptomath.gcd(keyA, len(SYMBOLS)) != 1:
         sys.exit(
@@ -102,4 +99,4 @@ def get_random_key():
     import doctest
 
     doctest.testmod()
-    main()
+    # main()

graphs/connected_components.py

@@ -5,24 +5,9 @@
 
 """
 
-test_graph_1 = {
-    0: [1, 2],
-    1: [0, 3],
-    2: [0],
-    3: [1],
-    4: [5, 6],
-    5: [4, 6],
-    6: [4, 5],
-}
-
-test_graph_2 = {
-    0: [1, 2, 3],
-    1: [0, 3],
-    2: [0],
-    3: [0, 1],
-    4: [],
-    5: [],
-}
+test_graph_1 = {0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}
+
+test_graph_2 = {0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}
 
 
 def dfs(graph: dict, vert: int, visited: list) -> list:

graphs/strongly_connected_components.py

@@ -5,22 +5,9 @@
 
 """
 
-test_graph_1 = {
-    0: [2, 3],
-    1: [0],
-    2: [1],
-    3: [4],
-    4: [],
-}
-
-test_graph_2 = {
-    0: [1, 2, 3],
-    1: [2],
-    2: [0],
-    3: [4],
-    4: [5],
-    5: [3],
-}
+test_graph_1 = {0: [2, 3], 1: [0], 2: [1], 3: [4], 4: []}
+
+test_graph_2 = {0: [1, 2, 3], 1: [2], 2: [0], 3: [4], 4: [5], 5: [3]}
 
 
 def topology_sort(graph: dict, vert: int, visited: list) -> list:

greedy_method/test_knapsack.py

@@ -35,9 +35,7 @@ def test_negative_profit_value(self):
         # profit = [10, -20, 30, 40, 50, 60]
         # weight = [2, 4, 6, 8, 10, 12]
         # max_weight = 15
-        self.assertRaisesRegex(
-            ValueError, "Weight can not be negative.",
-        )
+        self.assertRaisesRegex(ValueError, "Weight can not be negative.")
 
     def test_negative_weight_value(self):
         """

machine_learning/word_frequency_functions.py

@@ -80,10 +80,7 @@ def document_frequency(term: str, corpus: str) -> int:
     )  # strip all punctuation and replace it with ''
     docs = corpus_without_punctuation.split("\n")
     term = term.lower()
-    return (
-        len([doc for doc in docs if term in doc]),
-        len(docs),
-    )
+    return (len([doc for doc in docs if term in doc]), len(docs))
 
 
 def inverse_document_frequency(df: int, N: int) -> float: