random_tournament(n, seed=None)
This algorithm adds, for each pair of distinct nodes, an edge with uniformly random orientation. In other words, :None:None:`\binom{n}{2}` flips of an unbiased coin decide the orientations of the edges in the graph.
The number of nodes in the returned graph.
Indicator of random number generation state. See Randomness<randomness>
.
A tournament on n nodes, with exactly one directed edge joining each pair of distinct nodes.
Returns a random tournament graph on n nodes.
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