Created
January 15, 2019 13:07
-
-
Save robbywashere-zz/bf45493c4e6b59c325dcb3f15db6fc07 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Graph { | |
| constructor(){ | |
| this.nodes = {}; | |
| } | |
| addNode(n){ | |
| if (!this.nodes[n]) this.nodes[n] = []; | |
| } | |
| addEdge(a,b){ | |
| this.nodes[a].push(b); | |
| } | |
| } | |
| let g = new Graph(); | |
| g.addNode(0); | |
| g.addNode(1); | |
| g.addNode(2); | |
| g.addNode(3); | |
| g.addEdge(0, 1) | |
| g.addEdge(0, 2) | |
| g.addEdge(1, 2) | |
| g.addEdge(2, 0) | |
| g.addEdge(2, 3) | |
| g.addEdge(3, 3) | |
| function bfs(graph,node){ | |
| const visited = new Set(); | |
| let q = [node]; | |
| visited.add(node); | |
| while (q.length) { | |
| let newNode = q.pop(); | |
| console.log(newNode); | |
| for (let adjNode of graph.nodes[newNode]){ | |
| if (!visited.has(adjNode)){ | |
| q.unshift(adjNode); | |
| visited.add(adjNode); | |
| } | |
| } | |
| } | |
| } | |
| bfs(g,2); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment