Bridges in Graph
Critical Connections in a Network - Tarjan’s Algorithm
Oct 19, 20253 min read3
Command Palette
Search for a command to run...
#dfs
Articles tagged with #dfs
Shortest Path in Undirected Graph
Problem You are given an adjacency list, adj of Undirected Graph having unit weight of the edges, find the shortest path from src to all the vertex and if it is unreachable to reach any vertex, then return -1 for that vertex. Examples : Input: adj[][...
Sep 7, 20254 min read11Topological sort (DFS | BFS)
Kahn's Algorithm
Aug 17, 20254 min read7Number of Distinct Islands
Problem Given a boolean 2D matrix grid of size n * m. You have to find the number of distinct islands where a group of connected 1s (horizontally or vertically) forms an island. Two islands are considered to be distinct if and only if one island is n...
Aug 10, 20253 min read1BFS and DFS of Graph traversal
BFS Given a connected undirected graph containing V vertices, represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0,...
Aug 3, 20254 min read2Diameter of Binary Tree
Problem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a p...
Oct 27, 20242 min read20