Boost logo

Boost :

From: Jonathan de Halleux (dehalleux_at_[hidden])
Date: 2004-02-16 04:01:31

On a second thought and after a bit of googling, don't you think that
Propp-Wilson Cycle Popping Random Tree algorithm would be more efficient ?

The paper describing the article is at It is very
well explained and pseudo-code is clear enough to easily implement it :)


At 18:50 9/02/2004 -0800, you wrote:
>Hi, everyone.
>For your informal reviewing pleasure, I've uploaded a
>random path algorithm with accompanying documentation
>I've stated in an earlier thread that I was working on
>a multi-state-mazes project. Obviously the ability to
>create random underlying paths could give the
>application high reusability value. It's my hope that
>other developers here will also find use for this
>algorithm in their own projects.
> Feedback appreciated!
> Cromwell Enage
>Do you Yahoo!?
>Yahoo! Finance: Get your refund fast by filing online.
>Unsubscribe & other changes:

Jonathan de Halleux, Research Assistant
Center for Systems Engineering and Applied Mechanics (CESAME)
Universite catholique de Louvain
Batiment Euler , Av. Georges Lemaitre, 4 Tel : +32-10-47 2595
B-1348 Louvain-la-Neuve Belgium
E-mail : dehalleux_at_[hidden]

Boost list run by bdawes at, gregod at, cpdaniel at, john at