Java-programs/BFS1.java at main · manshika13/Java-programs · GitHub

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
import java.util.*;
public class BFS1 {
    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 createGraph(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,3,1));
        graph[1].add(new Edge(1,0,1));

        graph[2].add(new Edge(2,4,1));
        graph[2].add(new Edge(2,0,1));

        graph[3].add(new Edge(3,4,1));
        graph[3].add(new Edge(3,5,1));
        graph[3].add(new Edge(3,1,1));

        graph[4].add(new Edge(4,5,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[6].add(new Edge(6,5,1));

    }
    public static void BFS1(ArrayList<Edge>[]graph){

        Queue<Integer> q =new LinkedList<>();
        boolean vis[]=new boolean[graph.length];
        q.add(0);//source 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 main(String[] args){
        int v=7;
        // array list of edges of graph
        // //in this we make a list of edges and passes the vertices
        //every vertex of the list is associated with the list
        ArrayList<Edge> graph[]=new ArrayList[v];
        createGraph(graph);
        BFS1(graph);


    }

}