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

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

Author: pre-commit-ci[bot]

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