The vertices for which the constraint will be calculated.
Defaults to all vertices.
weights
The weights of the edges. If this is NULL and there is
a weight edge attribute this is used. If there is no such edge
attribute all edges will have the same weight.
Details
Burt's constraint is higher if ego has less, or mutually
stronger related (i.e. more redundant) contacts. Burt's measure of
constraint, C[i], of vertex i's ego network
V[i], is defined for directed and valued graphs,