connected-components

Recursion

Count of connected components in given graph after removal of given Q vertices

Last Updated: 27 February 2023

Given an undirected graph g, the task is to find the number of coalitions formed in it after the removal of Q vertices and maximum vertices ...read more

Check if XOR of each connected component becomes equal after removing atmost P edges

Last Updated: 09 December 2022

Given, a Tree with N nodes, and an integer P, the task is to remove at edges in range [1, P) and find the XOR of nodes for every connected c...read more

Tree

Geeks-Premier-League-2022

Geeks Premier League

Queries to find number of connected grid components of given sizes in a Matrix

Similar Topics

DSA

21.1k+ articles

Mathematical

7.6k+ articles

Searching

1.6k+ articles

Competitive Programming

1.5k+ articles

Tree

1.3k+ articles

Algorithms

1.2k+ articles

Hash

1.2k+ articles

Recursion

980+ articles

Graph

860+ articles

DFS

350+ articles

Last Updated: 09 February 2023

Given a matrix mat[][] containing only of 0s and 1s, and an array queries[], the task is for each query, say k, is to find the number of con ...read more

Connect a graph by M edges such that the graph does not contain any cycle and Bitwise AND of connected vertices is maximum

Last Updated: 30 April 2021

Given an array arr[] consisting of values of N vertices of an initially unconnected Graph and an integer M, the task is to connect some vert ...read more

Maximum GCD of all nodes in a connected component of an Undirected Graph

Last Updated: 16 May 2022

Given an undirected graph consisting of V vertices and a 2d array E[][2] denoting edges between pairs of nodes. Given another array arr[] re...read more

Check for transitive property in a given Undirected Graph

Last Updated: 27 February 2023

Given an undirected graph G with vertices numbered in the range [1, N] and an array Edges[][] consisting of M edges, the task is to check if...read more

Technical Scripter 2020

Minimize count of connections required to be rearranged to make all the computers connected

Last Updated: 01 September 2023

Given an integer N, denoting the number of computers connected by cables forming a network and a 2D array connections[][], with each row (i, ...read more

Minimum Spanning Tree

Number of connected components of a graph ( using Disjoint Set Union )

Last Updated: 28 June 2022

Given an undirected graph G with vertices numbered in the range [0, N] and an array Edges[][] consisting of M edges, the task is to find the...read more

Maximum number of edges to be removed to contain exactly K connected components in the Graph

Last Updated: 27 August 2021

Given an undirected graph G with N nodes, M edges, and an integer K, the task is to find the maximum count of edges that can be removed such...read more

Queries to count connected components after removal of a vertex from a Tree

Last Updated: 07 October 2021

Given a Tree consisting of N nodes valued in the range [0, N) and an array Queries[] of Q integers consisting of values in the range [0, N)....read more

Minimum number of edges required to be removed from an Undirected Graph to make it acyclic

Last Updated: 21 June 2021

Given an undirected graph consisting of N nodes containing values from the range [1, N] and M edges in a matrix Edges[][], the task is to de...read more

Queries to check if vertices X and Y are in the same Connected Component of an Undirected Graph

Last Updated: 24 March 2021

Given an undirected graph consisting of N vertices and M edges and queries Q[][] of the type {X, Y}, the task is to check if the vertices X ...read more

Maximum sum of values of nodes among all connected components of an undirected graph

Searching

Advanced Data Structure

Last Updated: 06 December 2023

Given an undirected graph with V vertices and E edges. Every node has been assigned a given value. The task is to find the connected chain w...read more

Arrays

Algorithms

Competitive Programming

Data Structures

Count of unique lengths of connected components for an undirected graph using STL

Last Updated: 30 November 2021

Given an undirected graph, the task is to find the size of each connected component and print the number of unique sizes of connected compon...read more