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

G = nx.DiGraph([(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)])

if nx.is_tournament(G):
    path = nx.tournament.hamiltonian_path(G)
    print('Hamiltonian path:', path)
<|EOT|>
