Check whether the count sum of small [ v ] and count is the same as the total back edges and if the vertex v can be removed
if ( countAdj [ v ] + small [ v ] == totBackEdges && isPossible [ v ] ) { node = v ; } if ( node != -1 ) break ; } return node ; }