|
Boost Users : |
Subject: Re: [Boost-users] Shortest path feasibility code
From: Dmitry Bufistov (dmitry_at_[hidden])
Date: 2008-11-18 13:10:48
Hi,
I think Bellman-Form shortest path algorithm does it.
The algorithm is a part of BGL.
Regards,
Dmitry
paul wrote:
> Hi,
>
> Is there any public domain code that implements shortest path feasibility or
> negative cycle detection?
>
> Thanks,
>
> Paul
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net