For STEP 2 of Kosaraju 's Algorithm
static void dfsSecond ( int u ) { if ( visitedInv [ u ] ) return ; visitedInv [ u ] = true ; for ( int i = 0 ; i < adjInv . get ( u ) . size ( ) ; i ++ ) dfsSecond ( adjInv . get ( u ) . get ( i ) ) ; scc [ u ] = counter ; }