core numbers</p><pre class="codeinput">cn = corenums(A);
mean(cn)
</pre><pre class="codeoutput">
ans =

    1.9463

</pre><h2>Efficient repetition<a name="34"></a></h2>
         <p>Every time a gaimc function runs, it converts the adjacency matrix into a set of compressed sparse row arrays.  These arrays
            yield efficient access to the edges of the graph starting at a particular vertex.  For many function calls on the same graph,
            this conversion process slows the algorithms.  Hence, ga