A cycle cover of a given directed graph G $=($V$,$ E$)$ is a set of vertex$-$disjoint cycles that cover all the vertices. Describe and analyze an efficient algorithm to find a cycle cover for a given graph, or correctly report that no cycle cover exists.