n>

<span class="sd">        Returns:</span>
<span class="sd">            A list of edges sorted in increasing order of the :math:`g(v)` values. </span>
<span class="sd">            If ``return_g`` is True, also returns the ``g`` dictionary with the function values ``g[vertex_name]=func_value``. </span>

<span class="sd">        &quot;&quot;&quot;</span>
        <span class="n">g_e</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">g_omega_edges</span><span c