Skip to content

Modify Graph bfs method #847

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
raklaptudirm merged 1 commit into from
Nov 26, 2021
Merged

Modify Graph bfs method #847

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 9 additions & 11 deletions Data-Structures/Graph/Graph.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,21 +39,19 @@ class Graph {
* @param {number} source The source vertex to start BFS.
*/
bfs (source, output = value => console.log(value)) {
const queue = []
const queue = [[source, 0]] // level of source is 0
const visited = new Set()
queue.unshift([source, 0]) // level of source is 0
visited.add(source)

while (queue.length) {
const front = queue[0]
const node = front[0]
const level = front[1]
queue.shift() // remove the front of the queue
const [node, level] = queue.shift() // remove the front of the queue
if (visited.has(node)) { // visited
continue
}

visited.add(node)
output(`Visited node ${node} at level ${level}.`)
for (const next of this.adjacencyMap[node]) {
if (!visited.has(next)) { // not visited
queue.unshift([next, level + 1]) // level 1 more than current
visited.add(next)
}
queue.push([next, level + 1]) // level 1 more than current
}
}
}
Expand Down