Boost logo

Boost Users :

From: Doug Gregor (dgregor_at_[hidden])
Date: 2004-08-03 05:26:17


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 list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net