Let G= (V, E) be a directed a cyclic graph. A Hamiltonian path in G is a path which visits each vertex of V exactly once. Prove the following property: 

G has a Hamiltonian path 

if and only if 

G has a unique topological ordering.