And the solution on the previous slide shows that as long as you don't have a cycle, it guarantees a topological ordering does indeed exist and in fact it's a constructive proof, a constructive argument that gives an algorithm. 