A simple path in a graph is a path such that no vertex occurs twice in . Some authors relax this condition by permitting . In this case the path is usually called a cycle.
