GraphsHamiltonian CircuitCircuit that passes only once through each vertex in a directed graph. Example In this directed graph, the circuit that passes, in order, through the vertices A, B, C, D, E and A is a Hamiltonian circuit:
