Re: [Boost-Users] Non directed graph & breatdh first search

1 Aug 2003


      Hi
...
Here is my code:  
  std::vector<Vertex> p(boost::num_vertices(g));  
  boost::graph_traits<GraphvizGraph>::vertices_size_type  
d[num_vertices(g)];
std::fill_n(d, num_vertices (g), 0);  
  breadth_first_search (g, u, visitor(make_bfs_visitor	 
(std::make_pair(record_predecessors(&p[0],on_examine_edge()),record_d
istanc= 
es(&d[0],on_examine_edge()))))  
  );
You are using on_examine_edge event, use on_tree_edge instead. 
 
Regards 
-- 
Janusz Piwowarski