<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(1, 2), (1, 3), (2, 3), (3, 1), (4, 5), (5, 6), (6, 4)], how can you use NetworkX to return a random triad from this graph?
### Response:
import networkx as nx

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

# Generate a random triad
seed = 10  # You can set to None for a fully random state
random_triad_graph = nx.random_triad(G, seed=seed)

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