changed formating to match reqs.

Author: kszirtidis

digital_image_processing/filters/gabor_filter.py

@@ -48,9 +48,9 @@ def gabor_filter_kernel(
             _y = -sin_theta * px + cos_theta * py
 
             # fill kernel
-            gabor[y, x] = np.exp(-(_x**2 + gamma**2 * _y**2) / (2 * sigma**2)) * np.cos(
-                2 * np.pi * _x / lambd + psi
-            )
+            gabor[y, x] = np.exp(
+                -(_x**2 + gamma**2 * _y**2) / (2 * sigma**2)
+            ) * np.cos(2 * np.pi * _x / lambd + psi)
 
     return gabor
 

graphs/directed_and_undirected_weighted_graph.py

@@ -10,7 +10,7 @@ class DirectedGraph:
     def __init__(self):
         """
         Initialize an empty directed graph.
-        
+
         Example:
         >>> g = DirectedGraph()
         >>> g.graph
@@ -545,4 +545,5 @@ def bfs_time(self, s=-2):
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod(verbose=True)

greedy_methods/fractional_knapsack.py

@@ -39,9 +39,11 @@ def frac_knapsack(vl, wt, w, n):
     return (
         0
         if k == 0
-        else sum(vl[:k]) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
-        if k != n
-        else sum(vl[:k])
+        else (
+            sum(vl[:k]) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
+            if k != n
+            else sum(vl[:k])
+        )
     )
 
 

machine_learning/frequent_pattern_growth.py

@@ -240,7 +240,9 @@ def ascend_tree(leaf_node: TreeNode, prefix_path: list[str]) -> None:
         ascend_tree(leaf_node.parent, prefix_path)
 
 
-def find_prefix_path(base_pat: frozenset, tree_node: TreeNode | None) -> dict:  # noqa: ARG001
+def find_prefix_path(
+    base_pat: frozenset, tree_node: TreeNode | None
+) -> dict:  # noqa: ARG001
     """
     Find the conditional pattern base for a given base pattern.
 

matrix/matrix_class.py

@@ -204,9 +204,11 @@ def cofactors(self) -> Matrix:
         return Matrix(
             [
                 [
-                    self.minors().rows[row][column]
-                    if (row + column) % 2 == 0
-                    else self.minors().rows[row][column] * -1
+                    (
+                        self.minors().rows[row][column]
+                        if (row + column) % 2 == 0
+                        else self.minors().rows[row][column] * -1
+                    )
                     for column in range(self.minors().num_columns)
                 ]
                 for row in range(self.minors().num_rows)

sorts/bead_sort.py

@@ -31,7 +31,9 @@ def bead_sort(sequence: list) -> list:
     if any(not isinstance(x, int) or x < 0 for x in sequence):
         raise TypeError("Sequence must be list of non-negative integers")
     for _ in range(len(sequence)):
-        for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])):  # noqa: RUF007
+        for i, (rod_upper, rod_lower) in enumerate(
+            zip(sequence, sequence[1:])
+        ):  # noqa: RUF007
             if rod_upper > rod_lower:
                 sequence[i] -= rod_upper - rod_lower
                 sequence[i + 1] += rod_upper - rod_lower

strings/min_cost_string_conversion.py

@@ -132,7 +132,9 @@ def assemble_transformation(ops: list[list[str]], i: int, j: int) -> list[str]:
             elif op[0] == "R":
                 string[i] = op[2]
 
-                file.write("%-16s" % ("Replace %c" % op[1] + " with " + str(op[2])))  # noqa: UP031
+                file.write(
+                    "%-16s" % ("Replace %c" % op[1] + " with " + str(op[2]))
+                )  # noqa: UP031
                 file.write("\t\t" + "".join(string))
                 file.write("\r\n")