Skip to content

feat: Graph bfs #71

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

Closed
wants to merge 1 commit into from
Closed

feat: Graph bfs #71

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
44 changes: 44 additions & 0 deletions graphs/bfs.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
/*
A non-recursive implementation of bfs with worst-case space complexity O(|E|)
*/

function Vertex (name, neighbours) {
this.name = name;
this.neighbours = neighbours;
}

function bfs (root) {
var visited = {}
var stack = []

stack.push(root)
while(!!stack.length) {
var vertex = stack.shift()

if (!visited[vertex.name]) {
visited[vertex.name] = true
console.log('Visiting vertex ', vertex.name)

var len = vertex.neighbours.length
for (var index = 0; index < len; index++) {
stack.push(vertex.neighbours[index])
}
}
}
}

var root = new Vertex('root', [
new Vertex('child 1', [
new Vertex('grandchild 1', []), new Vertex('grandchild 2', [])
]),
new Vertex('child 2', [
new Vertex('grandchild 3', []),
]),
new Vertex('child 3', [
new Vertex('grandchild 4', [
new Vertex('grandgrandchild 1', [])
]),
]),
])

bfs(root)