Similar Topics

Web Technologies32.1K+ articles

DSA20.5K+ articles

Graph565+ articles

DFS360+ articles

Data Structures152+ articles

graph-cycle58+ articles

Dijkstra52+ articles

Graph Traversals45+ articles

Algorithms-Graph Traversals29+ articles

graph-basics14+ articles

Data Structures-Graph

24 posts

Python Graph Tools Module

Last Updated: 23 July 2025

The graph-tools module is a Python package designed for handling directed and undirected graphs, as well as complex networks. It emphasizes performance and provides a wide...read more

Data Structures-Graph

Connecting Nodes in a Graph with Sum-based Edge Conditions

Last Updated: 29 January 2024

Given a graph with N nodes (1 ot N) and an array A[] of size N, such that a[i] denotes the value of (i+1)th node. Initially, there are no edges in the graph. To add an edg...read more

Data Structures-Graph

Geeks Premier League 2023

Find the number of subsequences of N friends

Last Updated: 29 January 2024

Given two arrays A[] and B[] of length N and M respectively. A[] represents the age of N friends and B[] contains M number of pairs in the form of (X → Y), which denotes X...read more

article_image

Geeks Premier League

Data Structures-Graph

Algorithms-InsertionSort

Permutation and Combination

Pigeonhole Principle

top-dsa-problems

Geeks Premier League 2023

Dynamic Programming (DP) and Directed Acyclic Graphs (DAG)

Last Updated: 23 July 2025

Pre-Requisite:What is Directed Graph? | Directed Graph meaningDynamic Programming (DP) Tutorial with ProblemsEvery Dynamic Programming problem can be represented as a Dire...read more

article_image

Algorithms-Dynamic Programming

Data Structures-Graph

Minimum Score in an Undirected Graph

Last Updated: 23 July 2025

Given an undirected graph find all the cycles of length 3 and calculate the minimum score among all these cycles. The score of a cycle is the total number of edges which a...read more

article_image

Data Structures-Graph

Graph Traversals

Lexicographically smallest String by pair swapping

Last Updated: 23 July 2025

Suppose you are given a string Str of length N and a set of Pairs ( i, j such that 0 = i j N, 0 based indexing). Pair “i, j” means that you can swap the ith and jth cha...read more

article_image

Data Structures

Data Structures-Graph

Friendship Request Validation in a Network

Last Updated: 23 July 2025

You have a network of individuals, each labeled with a number from 0 to n - 1. Some individuals cannot be friends due to specific rules. You also have a list of friend req...read more

Data Structures-Graph

Minimum cost to convert a '1' to a given number

Last Updated: 23 July 2025

Given a positive integer 'n'. Starting with 1 find the minimum cost required to convert it to n using the following operations : Multiply the number by 2 with costs aAdd 1...read more

Data Structures-Graph

Greedy Algorithms

Maximizing Safety in a Robber-Infested Grid

Last Updated: 23 July 2025

Given a 2D matrix grid of size n x n, where each cell contains either a robber (denoted by 1), is empty (denoted by 0), or an obstacle (denoted by -1). Your starting posit...read more

article_image

Data Structures-Graph

Graph Traversals

Find all Critical Connections in the Graph

Last Updated: 23 July 2025

Given an undirected Connected graph of V vertices and E edges. A critical connectionis an edge that, if removed, will make some nodes unable to reach some other nodes, the...read more

article_image

Data Structures-Graph

Count Non-Path Triplets in a Tree

Last Updated: 23 July 2025

Given a tree with n vertices numbered from 1 to n. The ith edge connects vertex ai to vertex bi, the task is to find the number of tuples of integers (i, j, k) such that:...read more

Data Structures-Graph

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

article_image

Topological Sorting

graph-connectivity

Data Structures

Data Structures-Tree Traversals

Data Structures-Stack

Data Structures-Graph

Pendant Vertices, Non-Pendant Vertices, Pendant Edges and Non-Pendant Edges in Graph

Last Updated: 23 July 2025

Pre-requisites: Handshaking theorem.Pendant VerticesLet G be a graph, A vertex v of G is called a pendant vertex if and only if v has degree 1. In other words, pendant ver...read more

article_image

Data Structures-Graph

Adjacency List from Edges

Last Updated: 05 April 2026

Given an undirected graph with V vertices (0-based indexing) and edges, create an adjacency list of the graph.Examples:Input: V = 5, edges = [[0,1], [0,4], [4,1], [4,3], [...read more

article_image

Data Structures-Graph

Minimum time taken by each job to be completed given by a Directed Acyclic Graph

Last Updated: 23 June 2026

Given a Directed Acyclic Graph having V vertices and E edges, where each edge {U, V} represents the Jobs U and V such that Job V can only be started only after completion ...read more

article_image

Topological Sorting

Data Structures-Graph

Algorithms-Graph Traversals

Graph Traversals

1 2