topological sortWiktionary 原文释义（英文）名词 Noun(graph theory, computer science) An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering.