<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 2), (2, 0)], can you determine if this graph is a tournament using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()

# Add edges to the graph to form a tournament structure
G.add_edges_from([(0, 1), (1, 2), (2, 0)])

# Check if the graph is a tournament
is_tournament = nx.is_tournament(G)
print('Is the graph a tournament?', is_tournament)
<|EOT|>
