<｜begin▁of▁sentence｜>### Instruction:
Given a tournament graph with directed edges [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)], how can we find a Hamiltonian path using NetworkX?
### Response:
import networkx as nx

# Create a tournament graph
tournament_graph = nx.DiGraph([(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)])

# Check if the graph is a tournament
is_tournament = nx.is_tournament(tournament_graph)
print('Is tournament:', is_tournament)

# Find a Hamiltonian path
hamiltonian_path = nx.tournament.hamiltonian_path(tournament_graph)
print('Hamiltonian path:', hamiltonian_path)
<|EOT|>
