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

# Create a directed graph
tourn_G = nx.DiGraph([(0, 1), (1, 2), (2, 0)])

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