-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyGraph.java
More file actions
62 lines (62 loc) · 1.74 KB
/
MyGraph.java
File metadata and controls
62 lines (62 loc) · 1.74 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
import java.util.*;
public class MyGraph {
public static void main(String[] args) {
Graph g=new Graph(10);
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 3);
g.addEdge(1, 4);
g.addEdge(2, 5);
g.addEdge(2, 6);
g.addEdge(6, 7);
g.addEdge(5, 8);
g.addEdge(8, 9);
g.bfs(0);
System.out.println();
g.dfs(0);
}
}
class Graph{
List<List<Integer>> adjecencyList;
public Graph(int vertices){
adjecencyList=new ArrayList<>();
for(int i=0;i<vertices;i++){
adjecencyList.add(new ArrayList<>());
}
}
public void addEdge(int src,int destination){
adjecencyList.get(src).add(destination);
adjecencyList.get(destination).add(src);
}
public void bfs(int start){
boolean visited[]=new boolean[adjecencyList.size()];
Queue<Integer> queue=new LinkedList<>();
visited[start]=true;
queue.add(start);
while(!queue.isEmpty()){
int node=queue.poll();
System.out.print(node+" ");
for(int x:adjecencyList.get(node)){
if(!visited[x]){
visited[x]=true;
queue.add(x);
}
}
}
}
public void dfs(int start){
boolean visited[]=new boolean[adjecencyList.size()];
Stack<Integer> stk=new Stack<>();
stk.push(start);
while(!stk.isEmpty()){
int node=stk.pop();
if(!visited[node]){
visited[node]=true;
System.out.print(node+" ");
for(int x:adjecencyList.get(node)){
if(!visited[x])stk.push(x);
}
}
}
}
}