Union-Find Data Structure (Disjoint Set)
🎁 FREE Algorithms Interview Questions Course - https://bit.ly/3s37wON
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
Union-find data structure (or disjoint set) is extremely crucial in Kruskal's spanning tree algorithm. This is how we can check whether to include a given vertex in the final solution or not in amortized O(1) constant running time complexity.
This is what this lecture is about, let's get started!
🫂 Facebook: / globalsoftwarealgorithms
🫂 Instagram: / global.software.algorithms