algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

pre-commit autoupdate 2025-09-11 (#12963)

Browse Source 
* pre-commit autoupdate 2025-09-11

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

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

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2025-09-13 00:56:14 +02:00
committed by GitHub
parent 18c853d301
commit 63180d7e24
16 changed files with 33 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
graphs/graph_adjacency_list.py
View File

@@ -448,7 +448,7 @@ class TestGraphAdjacencyList(unittest.TestCase):
(
undirected_graph,
directed_graph,
random_vertices,
_random_vertices,
random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
@@ -502,7 +502,7 @@ class TestGraphAdjacencyList(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for vertex in random_vertices:
@@ -516,7 +516,7 @@ class TestGraphAdjacencyList(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for i in range(101):
@@ -530,7 +530,7 @@ class TestGraphAdjacencyList(unittest.TestCase):
(
undirected_graph,
directed_graph,
random_vertices,
_random_vertices,
random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
@@ -569,7 +569,7 @@ class TestGraphAdjacencyList(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for vertex in random_vertices:

10
graphs/graph_adjacency_matrix.py
View File

@@ -469,7 +469,7 @@ class TestGraphMatrix(unittest.TestCase):
(
undirected_graph,
directed_graph,
random_vertices,
_random_vertices,
random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
@@ -523,7 +523,7 @@ class TestGraphMatrix(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for vertex in random_vertices:
@@ -537,7 +537,7 @@ class TestGraphMatrix(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for i in range(101):
@@ -551,7 +551,7 @@ class TestGraphMatrix(unittest.TestCase):
(
undirected_graph,
directed_graph,
random_vertices,
_random_vertices,
random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
@@ -590,7 +590,7 @@ class TestGraphMatrix(unittest.TestCase):
undirected_graph,
directed_graph,
random_vertices,
random_edges,
_random_edges,
) = self.__generate_graphs(20, 0, 100, 4)
for vertex in random_vertices: