Re: [BGL] Best way to abort an algorithm from within a visitor?

From: Chris Russell (cdr_at_[hidden])
Date: 2002-09-20 14:58:12

Gee - I certainly didn't expect any controversy over this particular
question ;) Thanks for the help all. I have elected to use the exceptions
approach in my case as the number of vertices/edges in my graph is large and
the ratio of time spent unwinding the stack upon reaching my goal condition
vs. executing the algorithm to determine if there the condition is met at
all approaches zero. I should note that the exception method additionally
has the benefit of allowing me to throw the exact details back to the
calling code in a very clear and explicit manner.

Thanks again - Chris

"Jeff Faust" <jeff_at_[hidden]> wrote in message
news:ICEELEJLOALJHNHFDNIDAEKFDFAA.jeff_at_opticalres.com...
>
> Advice from three prevalent boost developers should not be dismissed, and
> indeed I won't.  However, I will maintain my purist stance on this issue
> until such a need arises for me to reexamine that stance.  Thanks for
> everybody's arguments.  I'll keep them in mind.
>
> Jeff
>
> -----Original Message-----
> From: news [mailto:news_at_[hidden]]On Behalf Of David Abrahams
> Sent: Friday, September 20, 2002 4:27 AM
> To: boost-users_at_[hidden]
> Subject: [Boost-Users] Re: Re: [BGL] Best way to abort an algorithm from
> withi n a visitor?
>
>
>
> "Jeff Faust" <jeff_at_[hidden]> wrote in message
> news:ICEELEJLOALJHNHFDNIDEEJNDFAA.jeff_at_opticalres.com...
>
> > An exceptional case that happens with every run can hardly be called
> > exceptional.
>
>
> One should be wary of ideas that ring too nicely in the ear. [...]
>
>