mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 21:59:30 +00:00
e6cf13cc03
* Update queue implementation Popping the first element of a list takes O(n) time. Using a cyclic queue takes O(1) time. * Add queue changes from extra files * Update indentation * Add empty line between imports * Fix lines * Apply suggestions from code review Co-authored-by: John Law <johnlaw.po@gmail.com> Co-authored-by: John Law <johnlaw.po@gmail.com>
49 lines
1.3 KiB
Python
49 lines
1.3 KiB
Python
# Check whether Graph is Bipartite or Not using BFS
|
|
|
|
|
|
# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
|
|
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
|
|
# 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()
|
|
visited = [False] * len(graph)
|
|
color = [-1] * len(graph)
|
|
|
|
def bfs():
|
|
while not queue.empty():
|
|
u = queue.get()
|
|
visited[u] = True
|
|
|
|
for neighbour in graph[u]:
|
|
|
|
if neighbour == u:
|
|
return False
|
|
|
|
if color[neighbour] == -1:
|
|
color[neighbour] = 1 - color[u]
|
|
queue.put(neighbour)
|
|
|
|
elif color[neighbour] == color[u]:
|
|
return False
|
|
|
|
return True
|
|
|
|
for i in range(len(graph)):
|
|
if not visited[i]:
|
|
queue.put(i)
|
|
color[i] = 0
|
|
if bfs() is False:
|
|
return False
|
|
|
|
return True
|
|
|
|
|
|
if __name__ == "__main__":
|
|
# Adjacency List of graph
|
|
print(checkBipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))
|