Method printGraph

Programs/Dijkstra.java:80–88

()

        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{