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.
先从这个心智模型开始
Topological sorting produces a linear order of a directed acyclic graph (DAG) such that every directed edge u→v places u before v.
它如何工作，不堆砌不必要的术语
Kahn's algorithm repeatedly removes zero-indegree vertices using a queue.
A DFS postorder approach is another common method.
把算法读成一连串决策
Define directed/undirected and weighted/unweighted assumptions.
Choose the graph representation.
Track algorithm state and handle disconnected/cyclic cases explicitly.
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.
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;
}不要死记语法。跟踪每一行中发生变化的状态，并把它与上面描述的不变量联系起来。
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.
适用场景
- Use the algorithm only when its graph assumptions match the problem.
通常哪里会出错
- Trying it on a graph with a directed cycle.
- Forgetting that multiple valid topological orders may exist.
专业回答结构
Mention dependency scheduling and cycle detection. In Kahn's algorithm, processing fewer than V nodes proves a cycle exists.
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.
关于复杂度应该提到什么？
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.
最常见的错误是什么？
Trying it on a graph with a directed cycle.