https://gateoverflow.in/549/gate1992-01-ix
In this question why union find algo is used so the tym complexity became O(ElogN) ......E is no. of edges N is no. of vertices
Instead of this we can use bfs to detect cycle in O(N+E) ....
so what should be the answer??