Tournament (graph theory)
（重定向自Tournament graph）
![](/Images/godic/202502/17/4-tournament.svg1756.png")
![A transitive tournament on 8 vertices.](/Images/godic/202502/17/8-tournament-transitive.svg1756.png")
A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of distinct vertices is connected by a single directed edge.