One thing I see wrong is that the depth_first_search algorithm requires that the graph that it is given has an 'boost::vertex_index_t' property. So change your Graph definition to: typedef adjacency_list<listS, listS, directedS, property<boost::vertex_index_t, int, vertex_color_t, default_color_type>, property<edge_weight_t, int>

Graph;

gast 128 wrote:

Dear all

It's already posted, but there was not a really good answer. If you take from boost graph 'examples/file_dependencies.cpp' and strip down some code, but change the graph type to:

typedef adjacency_list<listS, listS, directedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, int>

...

Graph;

Graph g;

default_dfs_visitor vis; depth_first_search(g, visitor(vis));

It gives C2678 on VC++ 7.1.

Does anyone know what's wrong/possible work around?

Wkr me

_________________________________________________________________ MSN Search, for accurate results! http://search.msn.nl