dsa2 min read
Course Schedule — Cycle Detection BFS/DFS
Determine if you can finish all courses given prerequisites. Equivalent to detecting a cycle in a directed graph using BFS (Kahn) or DFS coloring.
Read →
Topological-sort
6 articles
dsa1 min read
Course Schedule II — Topological Order
Return a valid course order given prerequisites. Kahn's BFS topological sort outputs nodes in processing order — that is the valid schedule.
Read →
dsa1 min read
Course Schedule — Topological Sort BFS (Kahns Algorithm)
Detect if all courses can be finished (no cycle) using Kahn's algorithm: BFS on in-degree zero nodes.
Read →
dsa1 min read
Course Schedule II — Topological Order via BFS
Return a valid course order using Kahn's BFS topological sort, or empty array if a cycle exists.
Read →
dsa2 min read
Topological Sort — Advanced Applications (DFS, Kahn, Cycle Detection)
Advanced topological sort: DFS-based with 3-color marking for cycle detection, Kahn's BFS approach, and applications in course scheduling, build systems, and task ordering.
Read →
dsa3 min read
Google — Alien Dictionary (Topological Sort on Characters)
Derive character ordering from a sorted alien dictionary using topological sort. Build a directed graph from adjacent word comparisons and apply Kahn's BFS algorithm.
Read →