-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraphDFS.js
51 lines (42 loc) · 1.04 KB
/
graphDFS.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
class Graph {
constructor() {
this.vertices = []
this.adjacencyList = {}
}
addVertex(vertex) {
this.vertices.push(vertex)
this.adjacencyList[vertex] = []
}
addEdge(vertex1, vertex2) {
this.adjacencyList[vertex1].push(vertex2)
this.adjacencyList[vertex2].push(vertex1)
}
dfs(startingVertex) {
const visited = {}
const result = []
const dfsHelper = (vertex) => {
if (!vertex) {
return null
}
visited[vertex] = true
result.push(vertex)
this.adjacencyList[vertex].forEach((neighbor) => {
if (!visited[neighbor]) {
return dfsHelper(neighbor)
}
})
}
dfsHelper(startingVertex)
return result
}
}
const graph = new Graph()
graph.addVertex("A")
graph.addVertex("B")
graph.addVertex("C")
graph.addVertex("D")
graph.addEdge("A", "B")
graph.addEdge("A", "C")
graph.addEdge("B", "D")
graph.addEdge("C", "D")
// console.log(graph.dfs("A"))