Course contentsShow
Computer Science
Lesson 1015 of 2,87224. Minimum Spanning Trees and Network FlowPro lesson

Kruskal's Algorithm: Union-Find Data Structure

Learn how the union-find (disjoint set) data structure enables efficient cycle detection in Kruskal's algorithm.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.