Skip to content

Update queue implementation #5391

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 8 additions & 5 deletions graphs/check_bipartite_graph_bfs.py
Original file line number Diff line number Diff line change
Expand Up @@ -6,14 +6,17 @@
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
from queue import Queue


def checkBipartite(graph):
queue = []
queue = Queue()
visited = [False] * len(graph)
color = [-1] * len(graph)

def bfs():
while queue:
u = queue.pop(0)
while not queue.empty():
u = queue.get()
visited[u] = True

for neighbour in graph[u]:
Expand All @@ -23,7 +26,7 @@ def bfs():

if color[neighbour] == -1:
color[neighbour] = 1 - color[u]
queue.append(neighbour)
queue.put(neighbour)

elif color[neighbour] == color[u]:
return False
Expand All @@ -32,7 +35,7 @@ def bfs():

for i in range(len(graph)):
if not visited[i]:
queue.append(i)
queue.put(i)
color[i] = 0
if bfs() is False:
return False
Expand Down