IsTournament returns true if the input graph is a tournament. It returns false otherwise.
A tournament is a directed graph G that satisfies the following property: for every pair of vertices u and v in G exactly one of the directed edges u,v or v,u is in G.
T1 ≔ Digraph⁡1,2,2,3,3,1
T1≔Graph 1: a directed unweighted graph with 3 vertices and 3 arc(s)
T2 ≔ Digraph⁡1,2,2,3,3,1,1,3
T2≔Graph 2: a directed unweighted graph with 3 vertices and 4 arc(s)
T3 ≔ Digraph⁡1,2,2,3
T3≔Graph 3: a directed unweighted graph with 3 vertices and 2 arc(s)
Download Help Document
What kind of issue would you like to report? (Optional)