name="l00038"></a><span class="lineno">   38</span>&#160;<span class="comment">// depending on the size of the graphs considered.</span></div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment">// The main interest is that arcs do not need to be kept. Thus the memory</span></div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">// complexity is O(n) where n is the number of nodes in the graph.</span></div>
<d