  Let $D$ be an directed graph on $p\geq 10$ vertices with minimum degree at
least $p-1$ and minimum semi-degree at least $ p/2 -1$. We present a detailed
proof of the following result [13]: The digraph $D$ is pancyclic, unless some
extremal cases (which are characterized).
