Dynamic Graph Connectivity with Rank-Based Queries
We are given an undirected graph containing N vertices, initial containing no edges. The system must process Q online queries of two distinct types: Type 1: Establish an undirected edge between vertices u and v. Type 2: Identify the k-th largest vertex identifier within the connected component conta...