On Wed, 2003-06-18 at 01:56, David Abrahams wrote:
> Aleksey Gurtovoy <[EMAIL PROTECTED]> writes:
>
> > David Abrahams wrote:
> >> John <[EMAIL PROTECTED]> writes:
> >>
> >
> > Here - http://www.jclark.com/sp/.
>
> Been there, done that, got the Windows binary package. No 'sx' executable.
>
On Wed, 2003-03-05 at 13:52, Vladimir Prus wrote:
> Tarjei Knapstad wrote:
>
> >> > > > d-e-f
> >> > > > /
> >> > > > a-b-c
> >> > > > \
> >> > > > g-h-i
> >> > > &
On Wed, 2003-03-05 at 10:09, David J. Pearce wrote:
> Hello,
>
> I believe there is bug in random_number_generator when you request a
> random number between 0 and 1. For example:
>
As far as I can understand you are asking for a ranomized integer value
in the range [0,n) (i.e. n exclusive). If
On Wed, 2003-03-05 at 11:23, vladimir josef sykora wrote:
>
> "Tarjei Knapstad" <[EMAIL PROTECTED]> wrote in message
> news:[EMAIL PROTECTED]
> > On Tue, 2003-03-04 at 21:44, Louis Lavery wrote:
>
> [snip]
>
> > > > In an algorithm I
On Wed, 2003-03-05 at 08:50, Louis Lavery wrote:
>
>
> [snip]
>
> > A possibility (as have recently been discussed IIRC) is to break off the
> > DFS by throwing an exception the second time start_vertex is invoked in
> > the visitor. I'm not too fond of that solution though, allthough I must
> >
On Wed, 2003-03-05 at 07:53, Vladimir Prus wrote:
>
> Tarjei Knapstad wrote:
>
> > The second problem however is a property of the DFS algorithm where a
> > starting vertex is given that I had overlooked. After the DFS has
> > discovered all the vertices reachable f
just adding a boolean flag to the DFS
algos of course), or if I'm just going about things the wrong way here.
Does this sort of restricted DFS make any sense as a general purpose
tool? If you have large graphs and for instance want to do DFS/BFS on
just a small branch of it, this seems to be
