If edge u -> v means “u must come before v”, a topological order lists all vertices so that every edge points forward. It exists only for a DAG, and it is usually not unique.
Topological sort
An ordering of a DAG's vertices in which every edge goes from earlier to later.