A Hamiltonian path is a path that visits each vertex of the graph exactly once.

Show that every tournament* has a Hamiltonian path.

*A tournament is a complete directed graph.