Fix yesqa hook

.pre-commit-config.yaml

@@ -41,13 +41,19 @@ repos:
     rev: 5.0.4
     hooks:
       - id: flake8 # See .flake8 for args
-        additional_dependencies:
+        additional_dependencies: &flake8-plugins
           - flake8-bugbear
           - flake8-builtins
           - flake8-broken-line
           - flake8-comprehensions
           - pep8-naming
-          - yesqa
+
+  - repo: https://github.com/asottile/yesqa
+    rev: v1.4.0
+    hooks:
+      - id: yesqa
+        additional_dependencies:
+          *flake8-plugins
 
   - repo: https://github.com/pre-commit/mirrors-mypy
     rev: v0.982

DIRECTORY.md

@@ -356,14 +356,14 @@
   * [Articulation Points](graphs/articulation_points.py)
   * [Basic Graphs](graphs/basic_graphs.py)
   * [Bellman Ford](graphs/bellman_ford.py)
-  * [Bfs Shortest Path](graphs/bfs_shortest_path.py)
-  * [Bfs Zero One Shortest Path](graphs/bfs_zero_one_shortest_path.py)
   * [Bidirectional A Star](graphs/bidirectional_a_star.py)
   * [Bidirectional Breadth First Search](graphs/bidirectional_breadth_first_search.py)
   * [Boruvka](graphs/boruvka.py)
   * [Breadth First Search](graphs/breadth_first_search.py)
   * [Breadth First Search 2](graphs/breadth_first_search_2.py)
   * [Breadth First Search Shortest Path](graphs/breadth_first_search_shortest_path.py)
+  * [Breadth First Search Shortest Path 2](graphs/breadth_first_search_shortest_path_2.py)
+  * [Breadth First Search Zero One Shortest Path](graphs/breadth_first_search_zero_one_shortest_path.py)
   * [Check Bipartite Graph Bfs](graphs/check_bipartite_graph_bfs.py)
   * [Check Bipartite Graph Dfs](graphs/check_bipartite_graph_dfs.py)
   * [Check Cycle](graphs/check_cycle.py)
@@ -678,6 +678,7 @@
   * [N Body Simulation](physics/n_body_simulation.py)
   * [Newtons Law Of Gravitation](physics/newtons_law_of_gravitation.py)
   * [Newtons Second Law Of Motion](physics/newtons_second_law_of_motion.py)
+  * [Potential Energy](physics/potential_energy.py)
 
 ## Project Euler
   * Problem 001

data_structures/binary_tree/non_recursive_segment_tree.py

@@ -103,7 +103,7 @@ def query(self, l: int, r: int) -> T | None:  # noqa: E741
         >>> st.query(2, 3)
         7
         """
-        l, r = l + self.N, r + self.N  # noqa: E741
+        l, r = l + self.N, r + self.N
 
         res: T | None = None
         while l <= r:  # noqa: E741

digital_image_processing/index_calculation.py

@@ -413,7 +413,7 @@ def ipvi(self):
         """
         return (self.nir / ((self.nir + self.red) / 2)) * (self.ndvi() + 1)
 
-    def i(self):  # noqa: E741,E743
+    def i(self):
         """
         Intensity
         https://www.indexdatabase.de/db/i-single.php?id=36

genetic_algorithm/basic_string.py

@@ -80,7 +80,7 @@ def evaluate(item: str, main_target: str = target) -> tuple[str, float]:
             score = len(
                 [g for position, g in enumerate(item) if g == main_target[position]]
             )
-            return (item, float(score))  # noqa: B023
+            return (item, float(score))
 
         # Adding a bit of concurrency can make everything faster,
         #

maths/prime_sieve_eratosthenes.py

@@ -1,5 +1,3 @@
-# flake8: noqa
-
 """
 Sieve of Eratosthenes