How to make this algorithm stop when there are no more changes in the groups created by it

Question

I am trying to find an alternative algorithm that groups vectors in a list that are connected directly or indirectly - By \'connected\', I mean having a non-empty intersecti