30 Jan
2008
30 Jan
'08
4:21 p.m.
Connected components would work. -----Original Message----- From: Ioannis Nousias [mailto:s0238762@sms.ed.ac.uk] Sent: Wednesday, January 30, 2008 8:09 AM To: boost-users@lists.boost.org Subject: [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