Skip to content

Update queue implementation #5392

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.

Sign up for GitHub

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

Update queue implementation #5392

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
9 changes: 5 additions & 4 deletions graphs/breadth_first_search.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,7 @@

""" Author: OMKAR PATHAK """
from __future__ import annotations
from queue import Queue


class Graph:
Expand Down Expand Up @@ -51,19 +52,19 @@ def bfs(self, start_vertex: int) -> set[int]:
visited = set()

# create a first in first out queue to store all the vertices for BFS
queue = []
queue = Queue()

# mark the source node as visited and enqueue it
visited.add(start_vertex)
queue.append(start_vertex)
queue.put(start_vertex)

while queue:
vertex = queue.pop(0)
vertex = queue.get()

# loop through all adjacent vertex and enqueue it if not yet visited
for adjacent_vertex in self.vertices[vertex]:
if adjacent_vertex not in visited:
queue.append(adjacent_vertex)
queue.put(adjacent_vertex)
visited.add(adjacent_vertex)
return visited

Expand Down