15 views
22 Dec 2025
Explain how to represent a graph using adjacency list and adjacency matrix and compare their use cases....
15 views
22 Dec 2025
Traverse a graph using Breadth First Search and explain how a queue is used in the process....
15 views
22 Dec 2025
Traverse a graph using Depth First Search and explain the role of recursion or stack....
19 views
22 Dec 2025
Determine whether an undirected graph contains a cycle using DFS or BFS....
13 views
22 Dec 2025
Detect a cycle in a directed graph using DFS and recursion stack....
20 views
22 Dec 2025
Find the number of connected components in an undirected graph....
16 views
22 Dec 2025
Perform topological sorting of a directed acyclic graph using DFS or Kahn’s algorithm....
14 views
22 Dec 2025
Find the shortest path between two vertices in an unweighted graph using BFS....
14 views
22 Dec 2025
Find the shortest path from a source vertex to all other vertices in a weighted graph with non-negative edges....
13 views
22 Dec 2025
Compute shortest paths in a graph that may contain negative edge weights and detect negative cycles....
18 views
22 Dec 2025
Find shortest paths between all pairs of vertices using dynamic programming....
15 views
22 Dec 2025
Construct a minimum spanning tree of a graph using Kruskal’s algorithm....
11 views
22 Dec 2025
Construct a minimum spanning tree of a graph using Prim’s algorithm....
12 views
22 Dec 2025
Use Disjoint Set Union (Union-Find) to solve graph connectivity problems....
15 views
22 Dec 2025
Check whether a given graph is bipartite using BFS or DFS coloring....
15 views
22 Dec 2025
Find shortest paths in a Directed Acyclic Graph using topological ordering....
16 views
22 Dec 2025
Find strongly connected components in a directed graph using Kosaraju’s algorithm....
13 views
22 Dec 2025
Find articulation points in a graph whose removal increases number of connected components....
15 views
22 Dec 2025
Find all bridges in an undirected graph using DFS....
15 views
22 Dec 2025
Color the vertices of a graph such that no two adjacent vertices share the same color....
