<｜begin▁of▁sentence｜>### Instruction:
Imagine you're overseeing the flight paths at a bustling air traffic control center. Today, we're using a simplified model to understand the flow of aircraft between three specific waypoints, represented as nodes. The directed routes between these waypoints are: from waypoint 1 to waypoint 2, from waypoint 2 to waypoint 3, and from waypoint 3 back to waypoint 1. Picture this as a directed graph, and your task is to confirm whether this model forms a perfectly interconnected system akin to a triad in air traffic parlance, meaning each waypoint is directly connected to the other two. Could you check if this is the case using our standard NetworkX procedures?
### Response:
import networkx as nx

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

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