-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDFS.java
More file actions
83 lines (67 loc) · 2.01 KB
/
Copy pathDFS.java
File metadata and controls
83 lines (67 loc) · 2.01 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
public class DFS {
static class Edge{
int src;
int dest;
int wt;
public Edge(int s, int d, int w){
this.src = s;
this.dest = d;
this.wt = w;
}
}
public static void creatingGraph(ArrayList<Edge>[] graph){
// 0's vertex
graph[0].add(new Edge(0,1,1));
graph[0].add(new Edge(0,2,1));
// 1's vertex
graph[1].add(new Edge(1,0,1));
graph[1].add(new Edge(1,3,1));
// 2's vertex
graph[2].add(new Edge(2,0,1));
graph[2].add(new Edge(2,4,1));
// 3's vertex
graph[3].add(new Edge(3,1,1));
graph[3].add(new Edge(3,5,1));
graph[3].add(new Edge(3,4,1));
// 4's vertex
graph[4].add(new Edge(4,2,1));
graph[4].add(new Edge(4,3,1));
graph[4].add(new Edge(4,5,1));
// 5's vertex
graph[5].add(new Edge(5,3,1));
graph[5].add(new Edge(5,4,1));
graph[5].add(new Edge(5,6,1));
// 6's vertex
graph[6].add(new Edge(5,6,1));
}
public static void dfs(ArrayList<Edge>[] graph, int curr, boolean vis[]){ // O(V+E)
System.out.print(curr +" ");
vis[curr] = true;
for(int i=0;i<graph[curr].size();i++){
Edge e = graph[curr].get(i);
if(!vis[e.dest]){
dfs(graph, e.dest, vis);
}
}
}
public static void main(String[] args) {
// (1)--------(3)
/* / | \
* / | \
* (0) | (5)-------(6)
* \ | /
* \ | /
* (2)--------(4)
*/
int V = 7;
ArrayList<Edge>[] graph = new ArrayList[V];
for(int i=0;i<V;i++){
graph[i] = new ArrayList<>();
}
creatingGraph(graph);
dfs(graph, 0, new boolean[V]);
}
}