@@ -76,29 +76,25 @@ void clear(){
7676 }
7777
7878 // Maintain immutability
79- LinkedList <Integer >[] getCopy (LinkedList <Integer >[] adj , int n ){
79+ LinkedList <Integer >[] getCopy (LinkedList <Integer >[] graph , int n ){
8080 LinkedList <Integer > adjCopy [] = new LinkedList [n + 1 ];
8181 for (int i = 1 ; i <= n ; i ++){
8282 adjCopy [i ] = new LinkedList <Integer >();
83- for (int x : adj [i ]){
83+ for (int x : graph [i ]){
8484 adjCopy [i ].add (x );
8585 }
8686 }
8787 return adjCopy ;
8888 }
8989
90- void bfs (LinkedList <Integer > adj [], int root , int n ){
91- 90+ void bfs (LinkedList <Integer > graph [], int root , int n ){
9291 LinkedList <Integer > queue = new LinkedList <Integer >();
9392 depth [root ] = 0 ;
9493 queue .add (root );
9594 vis [root ] = true ;
96- 9795 while (!queue .isEmpty ()){
98- 99- int u = queue .removeFirst (); // The Stack
100- if (adj [u ].size () > 0 ){
101- int v = adj [u ].removeFirst ();
96+ int u = queue .removeFirst ();
97+ for (int v : graph [u ]){
10298 if (!vis [v ]){
10399 queue .add (v );
104100 vis [v ] = true ;
0 commit comments