modified: graphs/check_bipartite_graph_all.py

Author: shivaparihar6119

Diff for: graphs/check_bipartite_graph_all.py

@@ -24,7 +24,7 @@ def check_bipartite(graph: dict[int, list[int]])->bool:
     visited = [False] * len(graph)
     color = [-1] * len(graph)
 
-    def bfs()->bool:
+    def breadth_first_search() -> bool:
         while not queue.empty():
             u = queue.get()
             visited[u] = True
@@ -45,7 +45,7 @@ def bfs()->bool:
         if not visited[i]:
             queue.put(i)
             color[i] = 0
-            if bfs() is False:
+            if breadth_first_search() is False:
                 return False
     return True
 def is_bipartite(graph: defaultdict[int, list[int]]) -> bool: