Data-Structures---Algorithms/Constructing A graph at main · uditbhaskar21/Data-Structures---Algorithms · 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
package com.company;
import java.util.*;
import java.io.*;

import java.util.ArrayList;

public class graphframe {
    static class Edge{
        int s;
        int n;
        int w;
        Edge(int s, int n, int w){
            this.s = s;
            this.n = n;
            this.w = w;
        }
    }
    public static void main(String[] args)throws Exception {
        int vces = 7;
        ArrayList<Edge>[] graph = new ArrayList<Edge>[7];
        for (int i=0;i<vces;i++){
            graph[i]= new ArrayList<Edge>();
        }
        graph[0].add(new Edge(0,3,40));
        graph[0].add(new Edge(0,1,40));

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

        graph[2].add(new Edge(2,3,10));
        graph[2].add(new Edge(2,1,10));

        graph[3].add(new Edge(3,0,40));
        graph[3].add(new Edge(3,2,10));
        graph[3].add(new Edge(3,4,2));

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

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

        graph[6].add(new Edge(6,5,3));
        graph[6].add(new Edge(6,4,8));
        System.out.println(graph);

    }

}