Complete Digraph

Download Wolfram Notebook

CompleteDigraphs

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

See also

Acyclic Digraph, Complete Graph, Directed Graph, Oriented Graph, Ramsey's Theorem, Tournament

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Complete Digraph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CompleteDigraph.html

Subject classifications