Subject: Re: [Boost-users] [BGL] BFS < given distance.
From: Adam Spargo (aws_at_[hidden])
Date: 2010-11-25 12:23:50
> I had a very similar situation for the Dijkstra shortest path algorithm. The
> solution that I found was recommended on this list and on the doc pages. It
> is to throw an exception when the termination criterion is met.
That makes good sense, thanks.
-- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.