[Boost-users] BGL: return all shortest paths between two vertices

I have a subquestion... Is there an algorithm that will return all shortest paths between two vertices? (I.e. like Djikstra's algorithm but returning all, not just one, shortest path should such a condition exist). Regards. On 30 Jan 2008, at 16:08, Ioannis Nousias wrote:

Hello everyone.

This is a Boost Graph library question. Is there an algorithm in the library that can return all available paths between two vertices? If not, which algorithm from the library is best to use as a bases, to define a custom visitor for it? (assuming that is the preferred approach)

regards, Ioannis

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