Graph Algorithms

Course Schedule

Given a set of courses and their prerequisites, determine if you can finish all of them. This is a classic Topological Sort problem: if the prerequisite graph contains a cycle, completion is impossible.

Time ComplexityO(V + E)

Space ComplexityO(V + E)

Start Interactive Simulator

Kahn's Algorithm

We use a queue-based approach to iteratively process courses with zero incoming edges (no remaining prerequisites).

Cycle Detection

If we finish the process and some courses remain unvisited, it means there's a circular dependency (e.g., A needs B, B needs A).

🖱️ Click Canvas: Add Course • ↔️ Drag: Move • ⌨️ Shift+Click: Set Prerequisite

Loading Lab...

Graph Algorithms

Course Schedule

Time ComplexityO(V + E)

Space ComplexityO(V + E)

Start Interactive Simulator

Kahn's Algorithm

We use a queue-based approach to iteratively process courses with zero incoming edges (no remaining prerequisites).

Cycle Detection

If we finish the process and some courses remain unvisited, it means there's a circular dependency (e.g., A needs B, B needs A).

🖱️ Click Canvas: Add Course • ↔️ Drag: Move • ⌨️ Shift+Click: Set Prerequisite