i didn't understand the mean in Q 4.B
if G is undirected graph, so i can go from any vertex to any vertex (if it dont hole)
how i can limit the choice vertex then was a path to another K vertexs K vertex only
whether i can collect all the vertexs (without the holes), and it is S group?
and if this number equal to K return this group the if didn't the algorithm false??