Method Graph

Programs/Dijkstra.java:68–74

(int v)

    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));