[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

dsa_programs/bellman_ford.py

@@ -6,7 +6,9 @@
 Edge = Tuple[T, T, float]
 
 
-def bellman_ford(vertices: Iterable[T], edges: Iterable[Edge], source: T) -> Dict[T, float]:
+def bellman_ford(
+    vertices: Iterable[T], edges: Iterable[Edge], source: T
+) -> Dict[T, float]:
     edge_list: List[Edge] = list(edges)
     vertex_set: Set[T] = set(vertices)
     for u, v, _ in edge_list:

dsa_programs/dijkstra_shortest_path.py

@@ -15,7 +15,9 @@ def dijkstra_shortest_path(graph: Graph, source: T) -> Dict[T, float]:
         current_dist, node = heappop(heap)
         if current_dist > distances.get(node, float("inf")):
             continue
-        for neighbor, weight in graph.get(node, ()):  # missing key means no outgoing edges
+        for neighbor, weight in graph.get(
+            node, ()
+        ):  # missing key means no outgoing edges
             cost = current_dist + weight
             if cost < distances.get(neighbor, float("inf")):
                 distances[neighbor] = cost

dsa_programs/knapsack_01.py

@@ -11,5 +11,7 @@ def knapsack_01(items: Sequence[Item], capacity: int) -> int:
     dp: List[int] = [0] * (capacity + 1)
     for weight, value in items:
         for current_capacity in range(capacity, weight - 1, -1):
-            dp[current_capacity] = max(dp[current_capacity], dp[current_capacity - weight] + value)
+            dp[current_capacity] = max(
+                dp[current_capacity], dp[current_capacity - weight] + value
+            )
     return dp[capacity]

dsa_programs/rabin_karp.py

@@ -3,7 +3,9 @@
 from typing import List
 
 
-def rabin_karp_search(text: str, pattern: str, base: int = 256, modulus: int = 1_000_000_007) -> List[int]:
+def rabin_karp_search(
+    text: str, pattern: str, base: int = 256, modulus: int = 1_000_000_007
+) -> List[int]:
     if not pattern:
         return list(range(len(text) + 1))
     if len(pattern) > len(text):

dsa_programs/reservoir_sampling.py

@@ -6,7 +6,9 @@
 T = TypeVar("T")
 
 
-def reservoir_sample(stream: Iterable[T], k: int, rng: Optional[random.Random] = None) -> List[T]:
+def reservoir_sample(
+    stream: Iterable[T], k: int, rng: Optional[random.Random] = None
+) -> List[T]:
     if k <= 0:
         raise ValueError("Sample size must be positive")
     rand = rng or random.Random()

dsa_programs/tarjan_scc.py

@@ -36,7 +36,9 @@ def strong_connect(node: T) -> None:
                     break
             components.append(component)
 
-    for node in set(graph) | {neighbor for neighbors in graph.values() for neighbor in neighbors}:
+    for node in set(graph) | {
+        neighbor for neighbors in graph.values() for neighbor in neighbors
+    }:
         if node not in indices:
             strong_connect(node)
     return components