<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with nodes and edges, and knowing that triadic census categorizes all the triads in a directed graph into 16 categories based on the direction of their edges, how can you calculate the count of a particular triad type, let's say '120U', using the NetworkX implementation of triadic census?
### Response:
from networkx import DiGraph, triadic_census

# Create a directed graph
G = DiGraph()
# Add some edges to the graph
G.add_edge(1, 2)
G.add_edge(2, 3)
G.add_edge(3, 1)

# Compute the triad census
triads = triadic_census(G)

# Access a specific triad count using the __getitem__ method
triad_120U = triads['120U']
print(f'The count of triad 120U is: {triad_120U}')
<|EOT|>
