Commit b24f1f6

authored

chore: use internal queue definition in BFS (TheAlgorithms#1228)

1 parent 0529e19 commit b24f1f6Copy full SHA for b24f1f6

File tree

-4

lines changed

-4

lines changed

Lines changed: 7 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+import Queue from '../Data-Structures/Queue/Queue'`
	`2`	`+`
`1`	`3`	`/**`
`2`	`4`	`* Breadth-first search is an algorithm for traversing a graph.`
`3`	`5`	`*`
`@@ -12,11 +14,12 @@ export function breadthFirstSearch (graph, startingNode) {`
`12`	`14`	`const visited = new Set()`
`13`	`15`
`14`	`16`	`// queue contains the nodes to be explored in the future`
`15`		`- const queue = [startingNode]`
	`17`	`+ const queue = new Queue()`
	`18`	`+ queue.enqueue(startingNode)`
`16`	`19`
`17`		`- while (queue.length>0) {`
	`20`	`+ while (!queue.isEmpty()) {`
`18`	`21`	`// start with the queue's first node`
`19`		`- const node = queue.shift()`
	`22`	`+ const node = queue.dequeue()`
`20`	`23`
`21`	`24`	`if (!visited.has(node)) {`
`22`	`25`	`// mark the node as visited`
`@@ -25,7 +28,7 @@ export function breadthFirstSearch (graph, startingNode) {`
`25`	`28`
`26`	`29`	`// put all its neighbors into the queue`
`27`	`30`	`for (let i = 0; i < neighbors.length; i++) {`
`28`		`- queue.push(neighbors[i])`
	`31`	`+ queue.enqueue(neighbors[i])`
`29`	`32`	`}`
`30`	`33`	`}`
`31`	`34`	`}`

Comments

(0)