English Dictionary

topological sort

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.

Topological sort is an algorithm used in graph theory to order the vertices of a directed graph.

意味（1）

(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.