Path that passes only once through each of the vertices in a directed graph.
In this directed graph, the path connecting the vertices A, B, C, D and E in order is a Hamiltonian path of length 5. It is formed by the arcs a, b, c, d and e.
Note that it is not necessary for the path to pass through all of the edges of the graph. It’s like a postal delivery person’s path, which must pass by all of the addresses along the route.