Directed Hamiltonian Paths and Cycles

These are paths and cycles that visit every node in a directed graph exactly once.