 Cycle cover of a directed graph

A cycle cover of a finite directed graph is a collection of vertex-disjoint directed cycles containing every vertex exactly once. Cycle covers of the weighted directed graph with adjacency matrix $A$ are the terms in the permanent of a matrix $\mathrm{perm}A$.

This is a vertex cycle cover with the additional requirements of directed cycles and vertex disjointness.