Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find
Continue readingCategory: Graph
Bipartite Check using DFS – If Graph is Bipartite
Problem Statement: Given is a 2D adjacency list representation of a graph. Check whether the graph is Bipartite graph. (Note:
Continue readingKosaraju’s Algorithm for Strongly Connected Components(SCC)
Problem Statement: Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number
Continue readingTopological Sort (BFS)
Problem statement: Given a graph, find the topological order for the given graph. Topological sort: The linear ordering of nodes/vertices
Continue readingDetect a cycle in Undirected Graph : Breadth-First Search
Problem Statement: Given an undirected Graph, check for a cycle using BFS (Breadth-First Search) Traversal. Example: Input: Output: Yes Explanation:
Continue readingDepth First Search (DFS) traversal : Graph
Problem Statement: Given a graph, traverse through all the nodes in the graph using Depth First Search. Example: Input: Output:
Continue readingCycle Detection in Undirected Graph using DFS
Problem Statement: Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not.
Continue readingDetect A Cycle in Directed Graph using DFS
Problem Statement: Given is a 2D adjacency list representation of a directed graph. Check whether the graph has cycles are
Continue readingBreadth-First Search(BFS) : Level Order Traversal
Problem Statement: An Undirected Graph will be given. Return a vector of all the nodes of the Graph by Breadth-First
Continue readingM – Coloring Problem
Problem Statement: Given an undirected graph and a number m, determine if the graph can be colored with at most
Continue reading