such a graph is a path that visits every vertex precisely once and traverses edges in the correct
direction. A circuit with the same properties is called a directed Hamiltonian circuit.
Show that every directed complete graph has a directed Hamiltonian path.
Please can anyone give me ideas?