Re: [BGL] Daisy chaining algorithms using vistormechanism?

2 Oct 2002

      Whoops... My bad. I did this:

// given vertex_t Vertex, const graph_t& Graph
boost::graph_traits<my_graph_t>::edge_iterator iterInEdgeCurrent,
iterInEdgeEnd;
//..................................................^ Bozo no no
boost::tie(iterInEdgeCurrent, iterInEdgeEnd) =
boost::in_edges(Vertex,Graph);

... What I meant was:

boost::graph_traits<my_graph_t>::in_edge_iterator iterInEdgeCurrent,
iterInEdgeEdge;

Thanks Jeremy. Back on track.

Regards - Chris Russell