Java-programs/DFS_1.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
/*import java.util.ArrayList;

public class DFS_1 {
    public class Edge{
        int src;
        int dest;
        int weight;
        public Edge(int s,int d,int w){
            this.src=s;
            this.dest=d;
            this.weight=w;

        }

    }
   public static void DFS_1(){

   }

    static void createGraph(ArrayList<DFS_1.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 main(String[] args){
        int v=7;
        ArrayList<Edge> graph[]=new ArrayList[v];
        createGraph(graph);
        DFS_1();


    }


}
*/