is_tournament(G)
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.
Some definitions require a self-loop on each node, but that is not the convention used here.
A directed graph representing a tournament.
Whether the given graph is a tournament graph.
Returns True if and only if G is a tournament.
>>> from networkx.algorithms import tournamentSee :
... G = nx.DiGraph([(0, 1), (1, 2), (2, 0)])
... tournament.is_tournament(G) True
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them