All faces belonging to a connected component
are visited using a breadth first search algorithm.
Thus, indices "jumping around" as seen in the `stripe` test
are no longer a problem.

If there are faces left after dealing with an entire
connected component, the one with smallest index
is used as the reference for its connected component.