I tried something else which seems to work, however, it might be unefficient :<br><br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; if ( erase_nodes || erase_all )<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; while (num_vertices(*this)&gt;0)<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; MPPRectangleGraph::vertex_iterator vi, vi_end, next;
<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; boost::tie(vi, vi_end) = vertices(*this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; unsigned int i=0;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; clear_vertex(*vi, *this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; remove_vertex(*vi, *this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; }<br>
<br>Any help would be appreciate.<br><br>Regards<br><br><div><span class="gmail_quote">2007/11/12, Olivier Tournaire &lt;<a href="mailto:olitour@gmail.com">olitour@gmail.com</a>&gt;:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi all,<br><br>i&#39;m trying to clear an adjacency_list. I do the following, as described in the documentation :<br><br><br><br>void MPPRectangleGraph::Clear(unsigned int flags)<br>{<br>&nbsp;&nbsp;&nbsp; bool erase_nodes = false, erase_edges = false, erase_all = false;
<br>&nbsp;&nbsp;&nbsp; if ( flags&amp;GraphErase::eERASE_ALL )<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; erase_all = true;<br>&nbsp;&nbsp;&nbsp; else<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; if ( flags&amp;GraphErase::eERASE_NODES )<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; erase_nodes = true;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; if ( flags&amp;GraphErase::eERASE_EDGES )
<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; erase_edges = true;<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; if ( erase_nodes || erase_all )<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::cout &lt;&lt; &quot;begin&quot; &lt;&lt; std::endl;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; MPPRectangleGraph::vertex_iterator vi, vi_end, next;
<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; boost::tie(vi, vi_end) = vertices(*this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; unsigned int i=0;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::cout &lt;&lt; num_vertices(*this) &lt;&lt; std::endl;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; //clear_vertex(*vi, *this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; //remove_vertex(*vi, *this);
<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; for (next = vi; vi != vi_end; vi = next)<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::cout &lt;&lt; i++ &lt;&lt; std::endl;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; ++next;<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; clear_vertex(*vi, *this);<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; remove_vertex(*vi, *this);
<br>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp; std::cout &lt;&lt; &quot;end&quot; &lt;&lt; std::endl;<br>}<br><br>The MPPRectangleGraph is simply derived from adjacency_list. Containers are boost:vecS for both vertices and edges. When I have 100 vertices in my graph, I catch an unhandeld exception with catch(...) (&quot;i&quot; is printed only unitl 50), and, when my graph contains only 3 nodes, a std::exception is catched with this message : &quot;vector&lt;T&gt; too long&quot;.
<br>Can you help ?<br><br>Regards.<br>
</blockquote></div><br><br clear="all"><br>-- <br>Le temps des cerises reviendra. Dans l&#39;immédiat, c&#39;est le temps des noyaux. Courage.