17 views
22 Dec 2025
Explain basic graph terminology including vertices, edges, degree, path, cycle, and connected components with simple examples....
14 views
22 Dec 2025
Describe different types of graphs such as directed, undirected, weighted, unweighted, cyclic, and acyclic graphs....
15 views
22 Dec 2025
Represent a graph using an adjacency list and explain why it is memory efficient for sparse graphs....
15 views
22 Dec 2025
Represent a graph using an adjacency matrix and discuss its advantages and disadvantages....
13 views
22 Dec 2025
Traverse a graph using BFS and explain how the queue data structure is used....
15 views
22 Dec 2025
Traverse a graph using DFS and explain the recursive approach....
21 views
22 Dec 2025
Detect whether an undirected graph contains a cycle using DFS or BFS....
16 views
22 Dec 2025
Detect cycles in a directed graph using DFS and recursion stack....
15 views
22 Dec 2025
Find the number of connected components in an undirected graph....
13 views
22 Dec 2025
Perform topological sorting on a directed acyclic graph and explain its applications....
15 views
22 Dec 2025
Find the shortest path between two vertices in an unweighted graph using BFS....
13 views
22 Dec 2025
Compute shortest paths from a source vertex in a graph with non-negative weights....
13 views
22 Dec 2025
Find shortest paths and detect negative weight cycles using Bellman-Ford algorithm....
13 views
22 Dec 2025
Find shortest paths between all pairs of vertices using dynamic programming....
16 views
22 Dec 2025
Construct a minimum spanning tree using Prim’s algorithm....
14 views
22 Dec 2025
Construct a minimum spanning tree using Kruskal’s algorithm....
13 views
22 Dec 2025
Explain Union-Find (Disjoint Set Union) and its use in graph problems....
13 views
22 Dec 2025
Check whether a graph is bipartite using BFS or DFS coloring....
12 views
22 Dec 2025
Find strongly connected components using Kosaraju’s algorithm....
16 views
22 Dec 2025
Color a graph such that no two adjacent vertices share the same color....
