<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(1, 2), (2, 3), (3, 1), (3, 4), (4, 1), (4, 2)], how many of the 16 possible types of triads are present in the graph according to the triadic census?
### Response:
import networkx as nx

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

# Add edges
G.add_edges_from([(1, 2), (2, 3), (3, 1), (3, 4), (4, 1), (4, 2)])

# Compute the triadic census
triadic_census = nx.triadic_census(G)

# Print the results
for key, value in triadic_census.items():
    print(f"{key}: {value}")
<|EOT|>
