<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (1, 2), (0, 2), (2, 0)], can you use triadic_census from NetworkX to compute the triadic censuses and access the count of a specific triad configuration, such as '030T'?
### Response:
from networkx import DiGraph, triadic_census

# Create a directed graph
g = DiGraph([(0, 1), (1, 2), (0, 2), (2, 0)])

# Compute the triadic census
census = triadic_census(g)

# Access a specific triad configuration count, for example '030T'
triad_count = census['030T']
print(f'The count of triad 030T is {triad_count}')
<|EOT|>
