A closed path with at least one edge. In a graph, a cycle is a sequence v0, e1, v1,…, ek, vk (k≥1) of alternately vertices and edges (where ei is an edge joining vi−1 and vi), with all the edges different and all the vertices different, except that v0 = vk. See Hamiltonian graph, tree.