Fix style issues (flake8)

Author: gangs2314

graphs/graph_adjacency_list.py

@@ -235,10 +235,10 @@ def __generate_random_edges(
         assert edge_pick_count <= len(vertices)
 
         random_source_vertices: list[int] = random.sample(
-            vertices[0 : int(len(vertices) / 2)], edge_pick_count
+            vertices[0: int(len(vertices) / 2)], edge_pick_count
         )
         random_destination_vertices: list[int] = random.sample(
-            vertices[int(len(vertices) / 2) :], edge_pick_count
+            vertices[int(len(vertices) / 2):], edge_pick_count
         )
         random_edges: list[list[int]] = []
 

graphs/graph_adjacency_matrix.py

@@ -246,10 +246,10 @@ def __generate_random_edges(
         assert edge_pick_count <= len(vertices)
 
         random_source_vertices: list[int] = random.sample(
-            vertices[0 : int(len(vertices) / 2)], edge_pick_count
+            vertices[0: int(len(vertices) / 2)], edge_pick_count
         )
         random_destination_vertices: list[int] = random.sample(
-            vertices[int(len(vertices) / 2) :], edge_pick_count
+            vertices[int(len(vertices) / 2):], edge_pick_count
         )
         random_edges: list[list[int]] = []
 

graphs/heavy_light_decomposition.py

@@ -126,19 +126,19 @@ def query_path(
         while self.head[u] != self.head[v]:
             if self.depth[self.head[u]] > self.depth[self.head[v]]:
                 # Query from head[u] to u
-                segment = self.base_array[self.pos[self.head[u]] : self.pos[u] + 1]
+                segment = self.base_array[self.pos[self.head[u]]: self.pos[u] + 1]
                 res.extend(segment)
                 u = self.parent[self.head[u]]
             else:
-                segment = self.base_array[self.pos[self.head[v]] : self.pos[v] + 1]
+                segment = self.base_array[self.pos[self.head[v]]: self.pos[v] + 1]
                 res.extend(segment)
                 v = self.parent[self.head[v]]
 
         # Same chain now
         l, r = self.pos[u], self.pos[v]
         if l > r:
             l, r = r, l
-        segment = self.base_array[l : r + 1]
+        segment = self.base_array[l: r + 1]
         res.extend(segment)
 
         return operation(res) if res else 0

graphs/tests/test_graph_algorithms.py

@@ -3,27 +3,26 @@
 Run with: pytest tests/test_graph_algorithms.py -v
 """
 
+from graphs.max_bipartite_independent_set import (
+    MaxBipartiteIndependentSet,
+    max_bipartite_independent_set,
+)
+from graphs.heavy_light_decomposition import HeavyLightDecomposition
+from graphs.traveling_salesman import TravelingSalesman, held_karp
+from graphs.chinese_postman import ChinesePostman, chinese_postman
+from graphs.two_sat import TwoSAT, solve_2sat
+from graphs.push_relabel import PushRelabel
+from graphs.ford_fulkerson import FordFulkerson, ford_fulkerson
+from graphs.hopcroft_karp import HopcroftKarp, hopcroft_karp
+from graphs.johnsons_algorithm import johnsons_algorithm
+from graphs.floyd_warshall import floyd_warshall, reconstruct_path
 import pytest
 import sys
 import os
 
 # Add parent directory to path
 sys.path.insert(0, os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
 
-from graphs.floyd_warshall import floyd_warshall, reconstruct_path
-from graphs.johnsons_algorithm import johnsons_algorithm
-from graphs.hopcroft_karp import HopcroftKarp, hopcroft_karp
-from graphs.ford_fulkerson import FordFulkerson, ford_fulkerson
-from graphs.push_relabel import PushRelabel
-from graphs.two_sat import TwoSAT, solve_2sat
-from graphs.chinese_postman import ChinesePostman, chinese_postman
-from graphs.traveling_salesman import TravelingSalesman, held_karp
-from graphs.heavy_light_decomposition import HeavyLightDecomposition
-from graphs.max_bipartite_independent_set import (
-    MaxBipartiteIndependentSet,
-    max_bipartite_independent_set,
-)
-
 
 class TestFloydWarshall:
     """Test Floyd-Warshall all-pairs shortest path."""