Voozh

Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Greedy1.4K+ articles

Recursion591+ articles

Graph565+ articles

DFS360+ articles

base-conversion93+ articles

graph-connectivity64+ articles

disjoint-set51+ articles

Graph Traversals45+ articles

Delta to Star Conversion

Last Updated: 23 July 2025

In this article, we will discuss about delta to star conversion. Firstly, we will try to understand the two types of connections i.e. star and delta connections. The under...read more

👁 article_image

Picked

connected-components

Electrical Engineering

Electric circuits

Electrical Machines

Power Systems

Electric Circuits - Switches

Circuit Theory

Path queries through restricted weighted edges

Last Updated: 23 July 2025

Given a graph G with N vertices numbered from 1 to N and M undirected edges defined from vertex u to vertex v i.e. [ui, vi]. Each edge has an integer weight [wi] associate...read more

Connected component definition & meaning in DSA

Last Updated: 23 July 2025

Connected component in an undirected graph refers to a group of vertices that are connected to each other through edges, but not connected to other vertices outside the gr...read more

Definitions and Meanings

connected-components

Strongly Connected Component meaning in DSA

Last Updated: 23 July 2025

Strongly Connected Component (SCC) is a concept in graph theory, specifically in directed graphs. A subgraph of a directed graph is considered to be an SCC if and only if ...read more

Definitions and Meanings

connected-components

Delete Maximum edges such that Graph is traversable

Last Updated: 23 July 2025

Given an undirected graph of N node, where nodes are numbered from 1 to N, and an array of edges, where edges[i] = {edgeType, u, v} and two persons A and B are moving in i...read more

Technical Scripter 2022

DSA

disjoint-set

connected-components

Check if we can visit all other nodes from any node in given Directed Graph

Last Updated: 23 July 2025

Given N nodes, where each of them is numbered from 0 to N - 1, and array edges, where there is a directed edge from edges[i][0] to edges[i][1], the task is to find whether...read more

Count of nodes accessible from all other nodes of Graph

Last Updated: 23 July 2025

Given a directed graph with N nodes and M edges in array V[], the task is to find the number of nodes that are accessible from all other nodes i.e., they have at least one...read more

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

Last Updated: 23 July 2025

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 among all these connected compo...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 component formed. If node's valu...read more

👁 article_image

Tree

Geeks Premier League

Geeks-Premier-League-2022

DSA

connected-components

Construct a Graph from size of components for each node

Last Updated: 23 July 2025

Given an array A[] of size N, for each index i in the range [0, N) the value A[i] denotes the size of the connected component of node i. The task is to find the edges for ...read more

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

Last Updated: 23 July 2025

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 connected grid components (cells c...read more

Minimize number of notes required to be distributed among students

Last Updated: 23 July 2025

Given an array arr[] consisting of N strings representing the name of the students in the class and another array of pairs P[][2] such that P[i][0] likes P[i][1], the task...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: 23 July 2025

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 vertices of the graph with exactly ...read more

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

Last Updated: 23 July 2025

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

Check for transitive property in a given Undirected Graph

Last Updated: 23 July 2025

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 all triplets of the undirected...read more

👁 article_image

Technical Scripter 2020

DSA

DFS

connected-components

1 2 3

URL: https://www.geeksforgeeks.org/tag/connected-components/

⇱ connected-components Archives - GeeksforGeeks