In relation to a graph, a path is a finite sequence of edges such that the end of a vertex of an edge in the sequence is the start vertex of the next edge and in which no vertex appears more than once.