According to Wikipedia, in computing and graph theory, a dynamic connectivity structure is a data structure that dynamically maintains information about the connected components of a graph. Introduction In other words, a Dynamic connectivity Problem is a problem in which ...
Disjoint Set Union (DSU) is one such data structure. It is also referred to as Union Find because of the functionalities it provides. The efficiency of a data structure depends on efficiently it handles the query of some problem statement. ...
The purpose behind Krushal’s algorithm is to find a minimum spanning forest of an undirected edge-weighted graph. For instance, if the graph is connected, it will find a minimum spanning tree. Now, a Minimum Spanning Tree or MST in Krushal’s ...
