<｜begin▁of▁sentence｜>### Instruction:
Consider a directed graph with nodes 'A', 'B', and 'C' and edges [('A', 'B'), ('B', 'C'), ('C', 'A')]. Does this graph form a triad according to the 'is_triad' function in NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()

# Add edges to form a triad
G.add_edge('A', 'B')
G.add_edge('B', 'C')
G.add_edge('C', 'A')

# Check if the graph is a triad
is_triad = nx.is_triad(G)
print('Is G a triad?', is_triad)
<|EOT|>
