A topological sort is carried out on a directed graph with no cycles. Such a graph is called a directed, acyclic graph, often abbreviated DAG.

拓扑排序必须在无环的有向图中进行。这样的图叫做有向无环图，缩写为DAG。