<｜begin▁of▁sentence｜>### Instruction:
Given a randomly generated Erdős-Rényi graph with 10 vertices and 20 edges, can you calculate Burt's constraint scores for the vertices to analyze the extent of redundant contacts in the network? Print the calculated constraint scores directly.
### Response:
from igraph import Graph

g = Graph.Erdos_Renyi(n=10, m=20)
constraint_scores = g.constraint(vertices=None, weights=None)
print(constraint_scores)
<|EOT|>
