A :None:None:`tournament graph` is a complete oriented graph. In other words, it is a directed graph in which there is exactly one directed edge joining each pair of distinct nodes. For each function in this module that accepts a graph as input, you must provide a tournament graph. The responsibility is on the caller to ensure that the graph is a tournament graph.
To access the functions in this module, you must access them through the networkx.algorithms.tournament
module:
>>> from networkx.algorithms import tournament >>> G = nx.DiGraph([(0, 1), (1, 2), (2, 0)]) >>> tournament.is_tournament(G) True
<Unimplemented 'target' '.. _tournament graph: https://en.wikipedia.org/wiki/Tournament_%28graph_theory%29'>
Functions concerning tournament graphs.
Functions concerning tournament graphs.
A :None:None:`tournament graph` is a complete oriented graph. In other words, it is a directed graph in which there is exactly one directed edge joining each pair of distinct nodes. For each function in this module that accepts a graph as input, you must provide a tournament graph. The responsibility is on the caller to ensure that the graph is a tournament graph.
To access the functions in this module, you must access them through the networkx.algorithms.tournament
module:
>>> from networkx.algorithms import tournament >>> G = nx.DiGraph([(0, 1), (1, 2), (2, 0)]) >>> tournament.is_tournament(G) True
<Unimplemented 'target' '.. _tournament graph: https://en.wikipedia.org/wiki/Tournament_%28graph_theory%29'>
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.tournament.is_reachable
networkx.algorithms.tournament.score_sequence
networkx.algorithms.tournament.hamiltonian_path
networkx.algorithms.tournament.is_strongly_connected
networkx.algorithms.tournament.is_tournament
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