Graph – DSA

Filter by difficulty:

Minimum Spanning Tree (MST)

•

Kruskal Algorithm (Disjoint Set) - Time Complexity: O(E log V + E log E) Medium

Solution

•

Min Cost to Connect All Points Medium

Solution

Shortest Path (Weighted Graph)

•

Dijkstra Algorithm: Source → All vertices - Time Complexity: O(E log V) Medium

Solution

Topological Sorting (DAG)

•

Kahn’s Algorithm (BFS based) - Time Complexity: O(V + E) Medium

Solution

•

Can Finish All Courses Medium

Solution

•

Course Schedule – Return Order Medium

Solution

Graph Implementation

•

Adjacency Matrix Easy

Solution

•

Adjacency List Easy

Solution

•

Clone a Graph Medium

Solution

Graph Traversal

•

BFS (Queue + visited[]) - Used for shortest path Easy

Solution

•

DFS (Recursion + visited[]) - Used to find all path Easy

Solution

Graph Problems

•

Snake & Ladder – Min Steps (BFS) Medium

Solution

•

Bus Routes (BFS Variant) Hard

Solution

•

Return the least number of buses you must take to travel from source to target. Routes run infinitely: 1 → 5 → 7 → 1 → ... Hard

Solution

•

Min Distance Between Two Cells (Grid BFS) Medium

Solution

•

Evaluate Division (DFS Graph) Medium

Solution

•

Minimum Genetic Mutation (BFS) Medium

Solution

•

Min Score After Two Edge Removal Hard

Solution

Graph Algorithms