Searching in an unsorted array is not fast indeed. I tried with good success a faster route: An array, named used, with boolean Falses, one for each vertex, Then a loop over sets and vertex indeces found are raised to True.

Vertices are written when

I assume the array is deleted after the method ends and re-created when the method is called again.