A directed cycle is simply a cycle in a directed graph in which each edge is traversed in the same direction. If we think about directed edges as one-way streets, then a directed cycle is simply a walk through the graph that returns to the original node and travels down each street in the legal direction.

The directed graph below depicts a cycle formed of of three simple directed cycles (each of the blue nodes belongs to two distinct simple cycles).