modified: graphs/check_bipartite_graph_all.py

Author: shivaparihar6119

Diff for: graphs/check_bipartite_graph_all.py

@@ -41,8 +41,8 @@ def breadth_first_search() -> bool:
                     return False
         return True
 
-    for i in range(len(graph)):
-        if not visited[i]:
+    for i, v in enumerate(visited):
+        if not v:
             queue.put(i)
             color[i] = 0
             if breadth_first_search() is False: