What is a complete digraph?

• A. connection of nodes without containing any cycle
• B. connecting nodes to make at least three complete cycles
• C. start node and end node in a graph are same having a cycle
• D. connection of every node with every other node including itself in a digraph