Commit 60dd406

authored

use set to keep track of visited nodes, updated description

1 parent d11df93 commit 60dd406Copy full SHA for 60dd406

File tree

1 file changed

-4

lines changed

Graphs
- BreadthFirstShortestPath.js

1 file changed

-4

lines changed

`‎Graphs/BreadthFirstShortestPath.js‎`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`/*`
`2`		`-Breadth-first approach can be applied to determine the shortest path between two nodes in a graph. It searches the target node among all neighbors of the starting node. Then the process is repeated on the level of the neighbors of the neighbors and so on.`
	`2`	`+Breadth-first approach can be applied to determine the shortest path between two nodes in an unweighted graph. It searches the target node among all neighbors of the starting node. Then the process is repeated on the level of the neighbors of the neighbors and so on.`
`3`	`3`	`(See also: https://en.wikipedia.org/wiki/Breadth-first_search )`
`4`	`4`	`(see also: https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core )`
`5`	`5`	`*/`
`@@ -23,7 +23,7 @@ function breadthFirstShortestPath (graph, startNode, targetNode) {`
`23`	`23`	`}`
`24`	`24`
`25`	`25`	`// visited keeps track of all nodes visited`
`26`		`- const visited = []`
	`26`	`+ const visited = newSet()`
`27`	`27`
`28`	`28`	`// queue contains the paths to be explored in the future`
`29`	`29`	`const initialPath = [startNode]`
`@@ -35,9 +35,9 @@ function breadthFirstShortestPath (graph, startNode, targetNode) {`
`35`	`35`	`const node = path[path.length - 1]`
`36`	`36`
`37`	`37`	`// explore this node if it hasn't been visited yet`
`38`		`- if (!visited.includes(node)) {`
	`38`	`+ if (!visited.has(node)) {`
`39`	`39`	`// mark the node as visited`
`40`		`- visited.push(node)`
	`40`	`+ visited.add(node)`
`41`	`41`
`42`	`42`	`const neighbors = graph[node]`
`43`	`43`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 60dd406

File tree

1 file changed

1 file changed

`‎Graphs/BreadthFirstShortestPath.js‎`

0 commit comments