<｜begin▁of▁sentence｜>### Instruction:
In an upcoming article, we aim to shed light on the intricacies of network structures, particularly those akin to urban city plans or transportation networks. We stumbled upon a digital model of a simplified network represented within a dataset that highlighted the connectivity between four major nodes: Node 1 is connected to Node 2, Node 2 to Node 3, Node 3 to Node 4, and Node 4 circles back to Node 1, forming a closed loop. To deepen our analysis for our readers, we seek to ascertain whether this model exemplifies a regular graph—a concept where all nodes have an identical number of connections. Could NetworkX, a powerful tool in network analysis, confirm the regularity of this pattern through its 'is_regular' function? This information would be a fascinating addition to our exploration of symmetrical patterns within urban designs.
### Response:
import networkx as nx

G = nx.DiGraph([(1, 2), (2, 3), (3, 4), (4, 1)])
regular = nx.is_regular(G)
print('Is the graph regular:', regular)
<|EOT|>
