algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

use set to keep track of visited nodes, updated description

Browse Source
This commit is contained in:
algobytewise
2021-02-27 09:51:51 +05:30
committed by GitHub
parent d11df93cd0
commit 60dd4069e8
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Graphs/BreadthFirstShortestPath.js
View File

@ -1,5 +1,5 @@
/*
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.
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.
(See also: https://en.wikipedia.org/wiki/Breadth-first_search )
(see also: https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core )
*/
@ -23,7 +23,7 @@ function breadthFirstShortestPath (graph, startNode, targetNode) {
}
// visited keeps track of all nodes visited
const visited = []
const visited = new Set()
// queue contains the paths to be explored in the future
const initialPath = [startNode]
@ -35,9 +35,9 @@ function breadthFirstShortestPath (graph, startNode, targetNode) {
const node = path[path.length - 1]
// explore this node if it hasn't been visited yet
if (!visited.includes(node)) {
if (!visited.has(node)) {
// mark the node as visited
visited.push(node)
visited.add(node)
const neighbors = graph[node]