Re: [Boost-users] A question about boost::graph iterators

Douglas Gregor wrote:

I'd suggest replacing the Edge* with boost::optional<Edge>. You'll get about the same behavior but without the potential problems with taking the address of a temporary.

Doug

Thanks for the sugguestion, looks useful and I'll give it a try. By the way, after you discouraged me from attempting to using a subgraph to represent a spanning tree, I discovered filtered_graph. This is exactly what I was looking for.