Introduction - If you have any usage issues, please Google them yourself
Topological sort
A topological sort for a Directed Acyclic Graph (DAG) G is a linear sequence of all vertices in G, which makes any pair of vertices u and V in the graph, and if the edge (U, V) E (G) appears in the linear sequence, it appears before the linear sequence. Usually, such a linear sequence is called a sequence satisfying topological order (Topological Order), or topological sequence. Simply speaking, a complete order on the set is obtained from a partial order on a set. This operation is called topological sorting.