Re: [Boost-users] Print all routes in a graph

But Dijkstra give only the distances and the parent... not all the routes... Can you make me a simple example? Thanks Daniele Doug Gregor wrote:

On Aug 3, 2004, at 2:05 AM, Daniele Carlucci wrote:

...

Hi all, I have seen the mail with dijikstra algorithm, there is a way to print all the routes in a graph from a node A and a node B?

You can do this with Dijkstra's algorithm and a visitor that keeps track of predecessor sets.

Doug

_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users