图的深度广度优先遍历 | JS

 1 const graph = {
 2   0: [1, 2],
 3   1: [2],
 4   2: [0, 3],
 5   3: [3]
 6 }
 7 
 8 //深度优先遍历
 9 const visited = new Set();
10 const dfs = (n) => {
11   console.log(n);
12   visited.add(n);
13   graph[n].forEach(c => {
14     if(!visited.has(c)){
15       dfs(c);
16     }
17   })
18 }
19 dfs(2);
20 
21 //广度优先遍历
22 const visited = new Set();
23 visited.add(2);
24 const q = [2];
25 while(q.length) {
26   const n = q.shift();
27   console.log(n);
28   graph[n].forEach( c => {
29     if(!visited.has(c)){
30       q.push(c);
31       visited.add(c);
32     } 
33   })
34 }