networkx.algorithms.tournament.is_tournament¶

is_tournament
(G)[source]¶ Returns True if and only if
G
is a tournament.A tournament is a directed graph, with neither selfloops nor multiedges, in which there is exactly one directed edge joining each pair of distinct nodes.
 Parameters
G (NetworkX graph) – A directed graph representing a tournament.
 Returns
Whether the given graph is a tournament graph.
 Return type
Notes
Some definitions require a selfloop on each node, but that is not the convention used here.