Cycles
A cycle in a digraph is a path such that the last vertex of the last edge equals the first vertex of the first edge.
A simple cycle is one that visits each of its vertices once. I.e., there is one outgoing edge and one ingoing edge for each vertex on the path.