Topological Ordering

What:

A directed graph such that, given nodes $(u_i,u_j)$, $i<j$. In other words, the graph is always increasing.

Example:

Fun fact:

All Graphs that have topological orderings are DAGs. And vice versa!