Skip to content

chore: use internal queue definition in BFS #1228

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

Merged
merged 1 commit into from
Oct 27, 2022
Merged

chore: use internal queue definition in BFS #1228

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
11 changes: 7 additions & 4 deletions Graphs/BreadthFirstSearch.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,5 @@
import Queue from '../Data-Structures/Queue/Queue'

/**
* Breadth-first search is an algorithm for traversing a graph.
*
Expand All @@ -12,11 +14,12 @@ export function breadthFirstSearch (graph, startingNode) {
const visited = new Set()

// queue contains the nodes to be explored in the future
const queue = [startingNode]
const queue = new Queue()
queue.enqueue(startingNode)

while (queue.length > 0) {
while (!queue.isEmpty()) {
// start with the queue's first node
const node = queue.shift()
const node = queue.dequeue()

if (!visited.has(node)) {
// mark the node as visited
Expand All @@ -25,7 +28,7 @@ export function breadthFirstSearch (graph, startingNode) {

// put all its neighbors into the queue
for (let i = 0; i < neighbors.length; i++) {
queue.push(neighbors[i])
queue.enqueue(neighbors[i])
}
}
}
Expand Down