chore: use internal queue definition in BFS Shortest Path (TheAlgorithms#1230)

archaengel · web-flow · commit 945657a98f9e · 2022-10-27T18:45:33.000+05:30
diff --git a/Graphs/BreadthFirstShortestPath.js b/Graphs/BreadthFirstShortestPath.js
@@ -1,3 +1,4 @@
+import Queue from '../Data-Structures/Queue/Queue'
 /**
  * Breadth-first approach can be applied to determine the shortest path between two nodes in an equi-weighted graph.
  *
@@ -18,11 +19,12 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {
 
   // queue contains the paths to be explored in the future
   const initialPath = [startNode]
-  const queue = [initialPath]
+  const queue = new Queue()
+  queue.enqueue(initialPath)
 
-  while (queue.length > 0) {
+  while (!queue.isEmpty()) {
     // start with the queue's first path
-    const path = queue.shift()
+    const path = queue.dequeue()
     const node = path[path.length - 1]
 
     // explore this node if it hasn't been visited yet
@@ -42,7 +44,7 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {
         }
 
         // queue the new path
-        queue.push(newPath)
+        queue.enqueue(newPath)
       }
     }
   }

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+import Queue from '../Data-Structures/Queue/Queue'`
`1`	`2`	`/**`
`2`	`3`	`* Breadth-first approach can be applied to determine the shortest path between two nodes in an equi-weighted graph.`
`3`	`4`	`*`
`@@ -18,11 +19,12 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {`
`18`	`19`
`19`	`20`	`// queue contains the paths to be explored in the future`
`20`	`21`	`const initialPath = [startNode]`
`21`		`- const queue = [initialPath]`
	`22`	`+ const queue = new Queue()`
	`23`	`+ queue.enqueue(initialPath)`
`22`	`24`
`23`		`- while (queue.length > 0) {`
	`25`	`+ while (!queue.isEmpty()) {`
`24`	`26`	`// start with the queue's first path`
`25`		`- const path = queue.shift()`
	`27`	`+ const path = queue.dequeue()`
`26`	`28`	`const node = path[path.length - 1]`
`27`	`29`
`28`	`30`	`// explore this node if it hasn't been visited yet`
`@@ -42,7 +44,7 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {`
`42`	`44`	`}`
`43`	`45`
`44`	`46`	`// queue the new path`
`45`		`- queue.push(newPath)`
	`47`	`+ queue.enqueue(newPath)`
`46`	`48`	`}`
`47`	`49`	`}`
`48`	`50`	`}`