ShortestPathsAlgorithms/src/classes/Graph.java
private void fillAdjList(int n) {
        for (int i = 0; i < n; i++) {
            adjList.add(new ArrayList<Pair<Integer, Integer>>());
        }
    }
// fill the adjlist with the number of nodes

fill the adjlist with the number of nodes
fill the adjlist with the number of nodes
private void fillAdjList(int n) {
        for (int i = 0; i < n; i++) {
            adjList.add(new ArrayList<Pair<Integer, Integer>>());
        }
    }
private void fillAdjList ( int n ) { for ( int i = 0 ; i < n ; i ++ ) { adjList . add ( new ArrayList < Pair < Integer , Integer > > ( ) ) ; } }
fill the adjlist with the number of nodes
fill the adjlist with the number of nodes