graph-connectivity

64 posts

Adjacency List Generation from Edge Connections

Last Updated: 04 December 2023

Given a list of undirected edge connections of size E, create an adjacency list for a graph with V nodes and E edges following 0-based indexing and return the adjacency li...read more

Geeks Premier League 2023

Minimum difference between components of the Graph after each query

Last Updated: 23 July 2025

Given an integer N, denoting the total number of Nodes in a graph without any edges, you have to process Q queries of the form u, v which denotes that you have to add an e...read more

Kahn's Algorithm vs DFS Approach: A Comparative Analysis

Last Updated: 19 October 2023

Topological sorting is a common problem in computer science that involves arranging the vertices of a directed acyclic graph (DAG) in a linear order such that for every di...read more

Data Structures-Tree Traversals

Data Structures-Stack

Data Structures-Graph

Introduction to K-connected Graph

Last Updated: 19 March 2026

A k-connected graph is a type of graph where removing k-1 vertices (and edges) from the graph does not disconnect it. In other words, there are at least k distinct paths b...read more

Graph

Picked

DSA

Definitions and Meanings

graph-connectivity

The Earliest Moment When Everyone Become Friends

Last Updated: 23 July 2025

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} representing that the person U will be...read more

Count all Hamiltonian paths in a given directed graph

Last Updated: 03 October 2025

Given a directed graph of N vertices valued from 0 to N - 1 and array graph[] of size K represents the Adjacency List of the given graph, the task is to count all Hamilton...read more

Finding Astronauts from different countries

Last Updated: 23 July 2025

Given a positive integer N denoting the number of astronauts(labelled from 0 from (N - 1))and a matrix mat[][] containing the pairs of astronauts that are from the same co...read more

Print all Hamiltonian Cycles in an Undirected Graph

Last Updated: 23 July 2025

Given an undirected Graph consisting of N nodes in the form of an adjacency matrix graph[][] of size N*N, the task is to print all Hamiltonian cycles possible in the given...read more

Maximum product of a pair of nodes from largest connected component in a Graph

Last Updated: 23 July 2025

Given an undirected weighted graph G consisting of N vertices and M edges, and two arrays Edges[][2] and Weight[] consisting of M edges of the graph and weights of each ed...read more

Union and Intersection of two Graphs

Last Updated: 23 July 2025

Given two graphs G1 and G2, the task is to find the union and intersection of the two given graphs, i.e. (G1 ∪ G2) and (G1 ∩ G2).Examples:Input: G1 = { ("e1", 1, 2), ("e2"...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

Count permutations of first N natural numbers having sum of adjacent elements equal to a perfect square

Last Updated: 23 July 2025

Given a positive integer N, the task is to find the number of unique permutations of first N natural numbers having sum of the adjacent elements equal to a perfect square....read more

Make given segments non-overlapping by assigning directions

Last Updated: 23 July 2025

Given an array arr[][] consisting of N segments of the form {L, R, V} where, [L, R] denotes a segment with velocity V in any direction, the task is to check if it is possi...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

Find a set of at most N/2 nodes from a Graph such that all remaining nodes are directly connected to one of the chosen nodes

Last Updated: 03 October 2025

Given an integer N, representing the number of nodes present in an undirected graph, with each node valued from 1 to N, and a 2D array Edges[][], representing the pair of ...read more

1 2 3 4 5