topological sort

noun1

1. •
   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.