<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with nodes and edges specified as '[(0, 1), (1, 2), (2, 0)]', which means there is an edge from 0 to 1, from 1 to 2, and from 2 back to 0, can you determine if this graph is a tournament using the NetworkX API is_tournament?
### Response:
import networkx as nx

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

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

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