[BGL] single pair problem with bfs

Hi everybody! I really need to perform the single-pair problem. I have begin to implement it as it is written in some mail of the mailing list. I do a breadth first search and I want to use both a visitor recor_distances and a visito of my own which throws an exception to stop the algorithm when the destination is found. My problem is that I did'nt found the way to mix theses two visitors. Can you help me? regards, Jérémie ___________________________________________________________ Do You Yahoo!? -- Une adresse @yahoo.fr gratuite et en français ! Yahoo! Mail : http://fr.mail.yahoo.com