Hello, I recently tried to use some (almost all) shortest path algorithms from BGL. 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.
boost::adjacency_list <boost::setS, boost::listS, boost::bidirectionalS,[...]
This seems to trigger some troubles at compilation level. If I try anything else than vector for vertex list I'm rewarded by similar errors:
boost/graph/relax.hpp:55: error: no matching function for call to ‘put(long unsigned int*&, void*&, long unsigned int)’
My question is as follow, do algorithms handle graphs with list (or set) as vertex list containers? I searched for information about this on the internet and in the documentation but failed to find any clues. Thanks -- Christophe