This paper presents a solution to the problem of characterizing digraphs which have at least one square root. The characterization is stated in terms of the existence of a set of subdigraphs of the given digraph. The theorem of Mukhopadhyay which deals with square roots of non-directed graphs follows as a corollary.