<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(1, 2), (2, 3), (3, 1), (1, 3), (3, 2), (2, 1)], how can we calculate the triadic census, which shows the count of all possible triad types in the graph?
### Response:
import networkx as nx

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

# Add edges to the graph
G.add_edges_from([(1, 2), (2, 3), (3, 1), (1, 3), (3, 2), (2, 1)])

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

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