We present exact formulas for the number of digraphs in various interesting families: acyclic digraphs (dags), strongly connected digraphs, digraphs with constraints on their strongly connected components. They are obtained through generating function manipulations and were first discovered by Wright, Liskovets and Robinson.