Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

acyclic digraph | complete graph | directed graph | oriented graph | Ramsey's theorem | tournament