## Minimum Spanning Tree – MST using Kruskal’s Algo

Problem Statement: Given a weighted, undirected, and connected graph of V vertices and E edges. The task is to find

## 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:

## Kosaraju’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

## Topological Sort (BFS)

Problem statement: Given a graph, find the topological order for the given graph. Topological sort: The linear ordering of nodes/vertices

## Detect 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:

## Depth 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:

## Cycle 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.

## Detect 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