>% selective(g,n,n0,d) --- selective attachment random graph</span>
0003 <span class="comment">% overwrite g with a random graph with a degree-d selective attachment</span>
0004 <span class="comment">% graph on n vertices starting with n0 isolated vertices.</span>
0005 <span class="comment">%</span>
0006 <span class="comment">% That is, we begin with n0 isolated vertices. We then add vertices one at</span>
0007 <span class="comment">% a time. Each new vertex has d edges to previous vertices in the graph.</s