ALGORITHM READING NOTE

Topological Sorting

Topological sorting produces a linear order of a directed acyclic graph (DAG) such that every directed edge u→v places u before v.

TYPEAlgorithmCATEGORYGraphsDEPTHAdvancedTYPICAL COMPLEXITYO(V+E)

SHORT INTERVIEW ANSWER

Start with this mental model

Topological sorting produces a linear order of a directed acyclic graph (DAG) such that every directed edge u→v places u before v.

SIMPLE EXPLANATION

How it works, without unnecessary jargon

Kahn's algorithm repeatedly removes zero-indegree vertices using a queue.

A DFS postorder approach is another common method.

EXECUTION

Read the algorithm as a sequence of decisions

Define directed/undirected and weighted/unweighted assumptions.

Choose the graph representation.

Track algorithm state and handle disconnected/cyclic cases explicitly.

A small example to keep in mind

Read a tiny input by hand and write down the state after every important operation. For Topological Sorting, the goal is to make the invariant visible rather than to memorize code.

READABLE JAVASCRIPT IMPLEMENTATIONJavaScript

function topoSort(graph) {
  const indegree = new Map();
  for (const u of Object.keys(graph)) {
    indegree.set(u, indegree.get(u) ?? 0);
    for (const v of graph[u]) indegree.set(v, (indegree.get(v) ?? 0) + 1);
  }
  const queue = [...indegree].filter(([, d]) => d === 0).map(([v]) => v);
  const out = [];
  for (let i = 0; i < queue.length; i++) {
    const u = queue[i]; out.push(u);
    for (const v of graph[u] ?? []) if (indegree.set(v, indegree.get(v) - 1).get(v) === 0) queue.push(v);
  }
  return out.length === indegree.size ? out : null;
}

How to read this code

Do not memorize the syntax. Follow the state that changes on each line and connect it to the invariant described above.

COMPLEXITY

O(V+E)

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

WHEN TO USE IT

Good fit

Use the algorithm only when its graph assumptions match the problem.

COMMON MISTAKES

What usually goes wrong

Trying it on a graph with a directed cycle.
Forgetting that multiple valid topological orders may exist.

HOW TO EXPLAIN IT IN AN INTERVIEW

A professional answer shape

Mention dependency scheduling and cycle detection. In Kahn's algorithm, processing fewer than V nodes proves a cycle exists.

Problem→Core idea→Invariant / state→Big-O→Trade-off

QUICK INTERVIEW CHECK

What problem does Topological Sorting solve?

Topological sorting produces a linear order of a directed acyclic graph (DAG) such that every directed edge u→v places u before v.

What should I mention about complexity?

Its typical cost here is O(V+E), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

What is the most common mistake?

Trying it on a graph with a directed cycle.

Continue readingGraph representationDFS/BFSPriority queues