PAIRING(Graph Challenge)

#1

What is the most efficient way of doing this problem?

#2

Find connected components.
Any vertex from one set of C.C will definitely not have a path to other vertex of another C.C

#3

I did the same thing and it got accepted but is there some other approach to this question?

#4

Well done then! I This is most efficient i think!