Class Graph

Programs/Dijkstra.java:65–89

class Graph{
    int v;
    List<ArrayList<AdjNode>> adjList;
    Graph(int v){
        this.v = v;
        adjList = new ArrayList<>();
        for(int i = 0; i < this.v; i++){
            adjList.add(new ArrayList<>());
        }
    }

    public void addEdge(int u, int v, int cost){
        this.adjList.get(u).add(new AdjNode(u, v, cost));
        this.adjList.get(v).add(new AdjNode(v, u, cost));
    }
    public void printGraph(){
        for(int i = 0 ; i < this.v ; i++){
            System. out.print(i + " -> ");
            for(int j = 0 ; j < adjList.get(i).size(); j++){
                System.out.print(adjList.get(i).get(j).dest + " ");
            }
            System. out.println();
        }
    }
}

class AdjNode{
    int source, dest, cost;