Commit945657a

authored

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

1 parentb24f1f6 commit945657aCopy full SHA for 945657a

File tree

-4

lines changed

-4

lines changed

Lines changed: 6 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+importQueuefrom'../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`	`constinitialPath=[startNode]`
`21`		`-constqueue=[initialPath]`
	`22`	`+constqueue=newQueue()`
	`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`		`-constpath=queue.shift()`
	`27`	`+constpath=queue.dequeue()`
`26`	`28`	`constnode=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`	`}`

Comments

(0)