is_tournament

is_tournament(G)

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:

GNetworkX graph

A directed graph representing a tournament.

Returns:

bool

Whether the given graph is a tournament graph.

Notes

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

Examples

>>> G = nx.DiGraph([(0, 1), (1, 2), (2, 0)])
>>> nx.is_tournament(G)
True
----

Additional backends implement this function

graphblas : OpenMP-enabled sparse linear algebra backend.