Which graph algorithm the question is actually asking for
8 min read The wording of a graph problem tells you whether to reach for BFS, DFS, topological sort, union-find, or Dijkstra. Read article
Algorithms
Coding Interview Questions
What the Course Schedule problem is actually testing
6 min read Course Schedule and its harder sibling are dressed-up cycle detection on a directed graph, and there are two clean ways to handle both. Read article
Graphs
Topological Sort: Kahn’s Algorithm and DFS Approach
3 min read Topological sort is the graph algorithm you need for scheduling problems: course prerequisites, build systems, task dependencies, and package managers. Read article
