Hello,<br><br>I recently tried to use some (almost all) shortest path algorithms from BGL.<br>But since my program remove a lot of vertices, I opted for an adjacency list graph with list as vertex list container instead of vector.<br>
<br>&gt; boost::adjacency_list &lt;boost::setS, boost::listS, boost::bidirectionalS,[...]<br><br>This seems to trigger some troubles at compilation level.<br>If I try anything else than vector for vertex list I&#39;m rewarded by similar errors:<br>
<br>&gt; boost/graph/relax.hpp:55: error: no matching function for call to ‘put(long unsigned int*&amp;, void*&amp;, long unsigned int)’<br><br>My question is as follow, do algorithms handle graphs with list (or set) as vertex list containers?<br>
I searched for information about this on the internet and in the documentation but failed to find any clues.<br><br>Thanks<br clear="all"><br>-- <br>Christophe<br><br>