-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBFS.java
More file actions
78 lines (70 loc) · 2.06 KB
/
BFS.java
File metadata and controls
78 lines (70 loc) · 2.06 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
package datastructure.graph;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
/**
* The type Bfs.
*/
public class BFS {
/**
* Bfs string.
*
* @param graph the graph
* @return the string
*/
public static String bfs(AdjacencyListGraph graph){
String result="";
boolean[] visited = new boolean[graph.vertices];
for(int i=0;i< graph.vertices;i++){
if(!visited[i]){
result = result+bfsVisit(graph,i,visited);
}
}
return result;
}
private static String bfsVisit(AdjacencyListGraph graph, int source, boolean[] visited) {
String result = "";
Queue<Integer> queue = new LinkedList();
queue.add(source);
visited[source]=true;
while(!queue.isEmpty()){
int currentNode = queue.remove();
LinkedList<Integer> temp = null;
result += String.valueOf(currentNode);
if(graph.adjacencyList[currentNode] != null){
temp=graph.adjacencyList[currentNode];
}
for(int i=0;i<temp.size();i++){
if (!visited[temp.get(i)]) {
queue.add(temp.get(i));
visited[temp.get(i)] = true; //Visit the current Node
}
}
}
return result;
}
/**
* Main.
*
* @param args the args
*/
public static void main(String args[]) {
AdjacencyListGraph g = new AdjacencyListGraph(5);
g.addEdge(0,1);
g.addEdge(0,2);
g.addEdge(1,3);
g.addEdge(1,4);
System.out.println("Graph1:");
g.printGraph();
System.out.println("BFS traversal of Graph1 : " + bfs(g));
System.out.println();
AdjacencyListGraph g2 = new AdjacencyListGraph(5);
g2.addEdge(0,1);
g2.addEdge(0,4);
g2.addEdge(1,2);
g2.addEdge(3,4);
System.out.println("Graph2:");
g2.printGraph();
System.out.println("BFS traversal of Graph2 : " + bfs(g2));
}
}