The algorithm works because if a vertex has no successors, it must be the last one in the topological ordering.

• 算法能够执行是因为，如果一个顶点没有后继，那么它肯定是拓扑序列中的最后一个。