A simple path in a graph is a path $P=v_0 e_0 v_1\dots e_{n-1} v_n$ such that no vertex occurs twice in $P$ Some authors relax this condition by permitting $v_0=v_n$ In this case the path is usually called a cycle.