Developments in Dynamic Graph Algorithms

Network Connectivity Optimization | Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Session 21: Dynamic Connectivity Lower Bound | Advanced Data Structures | Electrical Engineering and Computer Science | MIT OpenCourseWare

Disjoint–Set Data Structure (Union–Find Algorithm) | Techie Delight

SOLVED: Consider a Union-Find data structure with five elements (labeled 0 through 4). Initially, every element is its own partition (equivalence class). Show the state of the data structure (both as a forest of trees and as an array) after performing the following operations:- union(0,1)- union(3,4)- union(0,3)

Introduction to Disjoint Set (Union-Find Data Structure) - GeeksforGeeks