Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

# 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 self-loops nor multi-edges, in which there is exactly one directed edge joining each pair of distinct nodes.

Parameters: G (NetworkX graph) – A directed graph representing a tournament. Whether the given graph is a tournament graph. bool

Notes

Some definitions require a self-loop on each node, but that is not the convention used here.