We use an exhaustive generation with isomorph-rejection to classify three types of structured digraphs. The first type is the class of regular digraphs where each vertex has the same number of out-neighbors and inneighbors. The second type is the class of normally regular digraphs introduced by Jørgensen. In these digraphs, the number of common out… (More)