<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with five vertices and edges (0,1), (1,2), (2,3), (3,0), and (1,0), how can you calculate and display the dyad census of the graph showing the number of mutual, asymmetric, and null dyad pairs?
### Response:
from igraph import Graph

# Create a directed graph with edges
g = Graph(directed=True)
g.add_vertices(5)
g.add_edges([(0,1), (1,2), (2,3), (3,0), (1,0)])

# Calculate the dyad census
dyad_census = g.dyad_census()

# Display the dyad census results
print('Mutual:', dyad_census.mutual)
print('Asymmetric:', dyad_census.asymmetric)
print('Null dyads:', dyad_census.null)
<|EOT|>
