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

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

Author: pre-commit-ci[bot]

Diff for: graphs/check_bipartite_graph_all.py

@@ -1,5 +1,6 @@
 from collections import defaultdict, deque
 
+
 def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
     """
     Check graph bipartite using DFS.
@@ -18,6 +19,7 @@ def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
     >>> is_bipartite_dfs(defaultdict(list, {0: [1, 2], 1: [0, 2], 2: [0, 1]}))
     False
     """
+
     def dfs(node, color):
         """
         DFS starting from a node.
@@ -48,6 +50,7 @@ def dfs(node, color):
             return False
     return True
 
+
 def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
     """
     Check graph bipartite using BFS.
@@ -82,6 +85,7 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
                         return False
     return True
 
+
 if __name__ == "__main":
     import doctest
 

Diff for: graphs/check_bipatrite.py

@@ -1,5 +1,6 @@
 from collections import defaultdict, deque
 
+
 def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
     """
     Check if a graph is bipartite using DFS.
@@ -19,6 +20,7 @@ def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
     >>> is_bipartite_dfs(defaultdict(list, {0: [1, 2], 1: [0, 3], 2: [0, 1]}))
     False
     """
+
     def dfs(node, color):
         """
         Perform Depth-First Search (DFS) on the graph starting from a node.
@@ -43,6 +45,7 @@ def dfs(node, color):
             return False
     return True
 
+
 def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
     """
     Check if a graph is bipartite using BFS.
@@ -77,6 +80,8 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
                     elif visited[neighbor] == visited[curr_node]:
                         return False
     return True
+
+
 if __name__ == "__main":
     import doctest
 
@@ -85,4 +90,4 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
     if result.failed:
         print(f"{result.failed} test(s) failed.")
     else:
-        print("All tests passed!")
+        print("All tests passed!")