|
Boost : |
From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-16 08:30:24
I think my graph is small and I don't want to pay for the dynamic allocation
of a buffer, so I'm guessing DFS.
-Dave
----- Original Message -----
From: "Jeremy Siek" <jsiek_at_[hidden]>
To: "boost" <boost_at_[hidden]>
Sent: Wednesday, January 16, 2002 8:27 AM
Subject: Re: [boost] BGL: Depth-first or breadth-first?
> On Tue, 15 Jan 2002, David Abrahams wrote:
> > If I'm only interested in determining reachability, is there any reason
> > prefer depth-first over breadth-first visit, or vice-versa? The docs
usually
> > provide some criterion to help guide a choice, but not here.
>
> Flip a coin ;)
>
> Actually, there's a chance one might be slightly faster than the other,
> but I haven't done the experiments.
>
> Cheers,
> Jeremy
>
> ----------------------------------------------------------------------
> Jeremy Siek http://www.osl.iu.edu/~jsiek/
> Ph.D. Student, Indiana Univ. B'ton email: jsiek_at_[hidden]
> C++ Booster (http://www.boost.org) office phone: (812) 855-3608
> ----------------------------------------------------------------------
>
>
>
> Info: http://www.boost.org Send unsubscribe requests to:
<mailto:boost-unsubscribe_at_[hidden]>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk