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

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