GraphsCircuitIn a directed graph, a path that starts and ends at the same vertex. In a directed graph, the length of a circuit is the number of arcs that make up this circuit. Example In this directed graph, the path made up of the arcs a, b, c, d, e and n in order is a circuit. The length of this circuit is 6. See also : Elementary circuit Eulerian circuit Hamiltonian circuit Simple circuit
