union-find

Picked

disjoint-set

The Earliest Moment When Everyone Become Friends

Last Updated: 24 March 2023

Given a group of N people, each having a unique ID value from 0 to (N - 1) and an array arr[] of M elements of the form {U, V, time} represe ...read more

Find number of closed islands in given Matrix

Last Updated: 22 February 2025

Given a binary matrix mat[][] of dimensions NxM such that 1 denotes the island and 0 denotes the water. The task is to find the number of cl ...read more

Algorithms-Graph Traversals

Similar Topics

DSA

22.4k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

Algorithms

2k+ articles

Tree

1.4k+ articles

Graph

940+ articles

Advanced Data Structure

580+ articles

DFS

340+ articles

disjoint-set

51+ articles

Minimum changes required to make two arrays identical

Last Updated: 02 September 2022

Given two arrays,[Tex]A[/Tex]and[Tex]B[/Tex]with n elements each. The task is to make these two arrays identical i:e, for each[Tex]1\leq i \ ...read more

Arrays

Competitive Programming

Union-Find Algorithm | (Union By Rank and Find by Optimized Path Compression)

Last Updated: 14 December 2022

Check whether a given graph contains a cycle or not.Example:Input: Output: Graph contains Cycle.Input: Output: Graph does not contain Cycle....read more

Calculate number of nodes between two vertices in an acyclic Graph by Disjoint Union method

Last Updated: 05 March 2023

Given a connected acyclic graph, a source vertex and a destination vertex, your task is to count the number of vertices between the given so...read more

Dynamic Connectivity | Set 1 (Incremental)

Last Updated: 06 June 2023

Dynamic connectivity is a data structure that dynamically maintains the information about the connected components of graph. In simple words ...read more

Find the number of Islands using Disjoint Set

Last Updated: 04 April 2025

Given ann x mgrid of'W'(Water) and'L'(Land), the task is to count the number of islands. An island is a group of adjacent'L'cells connected ...read more

graph-connectivity

Job Sequencing Problem using Disjoint Set

Last Updated: 27 March 2025

Given three arrays id[], deadline[], profit[], where each job i is associated with id[i], deadline[i], and profit[i]. Each job takes 1 unit ...read more

Disjoint Set Data Structures

Last Updated: 22 February 2025

A disjoint-set data structure is defined as one that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping ...read more

Tarjan's off-line lowest common ancestors algorithm

Last Updated: 02 March 2022

Prerequisite : LCA basics, Disjoint Set Union by Rank and Path CompressionWe are given a tree(can be extended to a DAG) and we have many que...read more

LCA

Kruskal's Minimum Spanning Tree using STL in C++

Last Updated: 27 March 2023

Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Kruskal's algorithm.Input : Graph a ...read more

Detect cycle in an undirected graph

Last Updated: 07 April 2025

Given an undirected graph, the task is to check if there is a cycle in the given graph.Examples:Input: V = 4, edges[][]= [[0, 1], [0, 2], [1...read more

Union By Rank and Path Compression in Union-Find Algorithm

Last Updated: 22 April 2025

In the previous post, we introduced the Union-Find algorithm. We employed the union() and find() operations to manage subsets.Code Implemen ...read more

Introduction to Disjoint Set (Union-Find Algorithm)

Last Updated: 26 February 2025

Two sets are called disjoint sets if they don't have any element in common. The disjoint set data structure is used to store such sets. It s...read more

Huawei