<｜begin▁of▁sentence｜>### Instruction:
Given a need to create a tournament graph where there is exactly one directed edge between each pair of distinct nodes, how would you use NetworkX to generate and print the edges of such a graph with 5 nodes?
### Response:
import networkx as nx

# Generate a random tournament graph with 5 nodes
G = nx.random_tournament(5, seed=42)

# Print the edges of the tournament
print('The edges of the tournament graph are:', G.edges())
<|EOT|>
