經安全檢測,此網站為安全網站,請放心前往原始網址!

Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm) - GeeksforGeeks

Hi, I have one doubt,why do we need to use Union find algorithm for loop detection,if both vertics of current edge are already visited ,then definately they would create loop.so why to spend extra log n processing time in finding of loop.I made a small pr

www.geeksforgeeks.org

網址安全性掃描由 google 提供