Re: [boost] Re: [BGL] Interest in a random-path algorithm.

From: Jonathan de Halleux (dehalleux_at_[hidden])
Date: 2004-02-11 03:53:13

I was interested on the random path algo, and I insist on giving credits.
Thanks,
Jonathan
At 08:59 10/02/2004 -0800, you wrote:
> > I would like to integrate that algorithm into
> > QuickGraph, a C# graph library.
> > <http://www.dotnetwiki.org>
> >
> > May I?
>
>You may do so.  The LSP algorithm for acyclic digraphs
>(nothing more than a shortest-path algorithm on edges
>with negative weights) is freely available across the
>Internet.
>
>                               Cromwell Enage
>
>
>__________________________________
>Do you Yahoo!?
>Yahoo! Finance: Get your refund fast by filing online.
>http://taxes.yahoo.com/filing.html
>_______________________________________________
>Unsubscribe & other changes: 
>http://lists.boost.org/mailman/listinfo.cgi/boost

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