<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 2), (2, 0), (1, 3)], can you use networkx.algorithms.triads.triad_census to find the count of each type of triad?
### Response:
import networkx as nx

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

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

# Perform triad census
tc = nx.triad_census(G)

# Print the triad census
print(tc)
<|EOT|>
