public List < IntArrayList > findComponents ( ) { int nodes = graph . getNodes ( ) ; for ( int start = 0 ; start < nodes ; start ++ ) { if ( nodeIndex [ start ] == 0 && ! ignoreSet . contains ( start ) && ! graph . isNodeRemoved ( start ) ) strongConnect ( start ) ; } return components ; }
Find and return list of all strongly connected components in g .