<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph represented by the edge set [(1, 2), (1, 3), (2, 3), (3, 1), (5, 6), (5, 4), (6, 7)], use NetworkX to obtain a subgraph that forms a random triad. Seed the random number generator for reproducible results.
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph([(1, 2), (1, 3), (2, 3), (3, 1), (5, 6), (5, 4), (6, 7)])

# Get a random triad from the graph using the random_triad function
triad = nx.random_triad(G, seed=1)

# Print the edges of the triad
print(triad.edges())
<|EOT|>
