Re: [Boost-users] [graph] depth_first_search with VertexList=listS

Tim Blechmann wrote:

hi all,

the following trivial code doesn't compile for me:

#include #include

typedef boost::adjacency_list graph_t; int main() { graph_t graph; boost::depth_first_search(graph, boost::visitor(boost::dfs_visitor<> ())); }

is there any way to run a depth_first_search, with an adjacency_list based graph class, using a VertexList=listS or setS?

Tim, See the documentation for the vertex_index_map parameter at http://www.boost.org/doc/libs/1_35_0/libs/graph/doc/depth_first_search.html: This maps each vertex to an integer in the range [0, num_vertices(g)). This parameter is only necessary when the default color property map is used. The type VertexIndexMap must be a model of Readable Property Map. The value type of the map must be an integer type. The vertex descriptor type of the graph needs to be usable as the key type of the map. Default: get(vertex_index, g). Note: if you use this default, make sure your graph has an internal vertex_index property. For example, adjacenty_list with VertexList=listS does not have an internal vertex_index property. HTH, -- Dave Abrahams BoostPro Computing http://www.boostpro.com