Skip to content

Instantly share code, notes, and snippets.

"""
Graph is represented as an adjacency list
"""
def BFS(self,root):
visited = [False]*(len(self.nodes))
queue = []
queue.append(root)
visited[root] = True
while queue: