-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgra.java
More file actions
77 lines (69 loc) · 2.15 KB
/
Copy pathgra.java
File metadata and controls
77 lines (69 loc) · 2.15 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
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.*;
public class gra {
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;
}
}
static void creatGraph(ArrayList<Edge> []graph){
for(int i=0; i<graph.length; i++){
graph[i] = new ArrayList<>();
}
graph[0].add(new Edge(0, 1, 1));
graph[0].add(new Edge(0, 2, 1));
graph[1].add(new Edge(1, 0, 1));
graph[1].add(new Edge(1, 3, 1));
graph[2].add(new Edge(2, 0, 1));
graph[2].add(new Edge(2, 4, 1));
graph[3].add(new Edge(3, 1, 1));
graph[3].add(new Edge(3, 4, 1));
graph[3].add(new Edge(3, 5, 1));
graph[4].add(new Edge(4, 2, 1));
graph[4].add(new Edge(4, 3, 1));
graph[4].add(new Edge(4, 5, 1));
graph[5].add(new Edge(5, 3, 1));
graph[5].add(new Edge(5, 4, 1));
graph[5].add(new Edge(5, 6, 1));
graph[5].add(new Edge(6, 5, 1));
}
public static void bfs(ArrayList<Edge> [] graph){
Queue<Integer> q = new LinkedList<>();
boolean vis[] = new boolean[graph.length];
q.add(0);
while(!q.isEmpty()){
int curr = q.remove();
if(!vis[curr]){
System.out.print(curr+ " ");
vis[curr] = true;
for(int i=0; i<graph[curr].size(); i++){
Edge e = graph[curr].get(i);
q.add(e.dest);
}
}
}
}
public static void dfs(ArrayList<Edge> [] graph, int curr, boolean vis[]){
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) {
int V = 7;
ArrayList<Edge> [] graph = new ArrayList[V];
creatGraph(graph);
// bfs(graph);
dfs(graph, 0, new boolean[V]);
}
}