Print all routes in a graph

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? Thanks Daniele Carlucci

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

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

On Tuesday 03 August 2004 9:33 am, Daniele Carlucci wrote:
But Dijkstra give only the distances and the parent... not all the routes... Can you make me a simple example?
You can modify Dijkstra's to do it; tell me how you want to modify Dijkstra's, and I can help you do it with the BGL.[*] Doug [*] We gave this problem as a homework assignment a few months ago...

I want to print on that sample all the routes that are in that graph. But all :-) From the node A and the node B. Thanks Daniele Doug Gregor wrote:
On Tuesday 03 August 2004 9:33 am, Daniele Carlucci wrote:
But Dijkstra give only the distances and the parent... not all the routes... Can you make me a simple example?
You can modify Dijkstra's to do it; tell me how you want to modify Dijkstra's, and I can help you do it with the BGL.[*]
Doug
[*] We gave this problem as a homework assignment a few months ago...
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
participants (2)
-
Daniele Carlucci
-
Doug Gregor