t</span><span class="p">(</span><span class="n">edge_list</span><span
        class="p">):</span>
    <span class="sd">&quot;&quot;&quot;</span>
<span class="sd">    Compute the euler tour of a graph ( with edges, including self loops, instead of nodes).</span>
<span class="sd">    https://en.wikipedia.org/wiki/Euler_tour_technique</span>

<span class="sd">    :param edge_list: An edge list.</span>
<span class="sd">    :return: A list containing the euler tour.</span>
<span class="sd">    &quot;&quot;&quot;