Re: [Boost-users] Performance issues with bellman_ford_shortest_paths

Subject: Re: [Boost-users] Performance issues with bellman_ford_shortest_paths
From: paul (paul.delamusica_at_[hidden])
Date: 2009-05-14 13:14:50

Paul De La Musica <paul.delamusica <at> gmail.com> writes:

> 
> Hi,
> 
>   I just did a timing experiment on bellman_ford_shortese_paths. It
> appears to be 200 times slower than LEDA. I am using BGL 1.33.1. Has
> anyone experienced this?
> 
> Thanks,
> 
> Paul
> 

The same happened on Release 1.38.0. The graph has negative cycles. In fact, 
the bellman_ford_shortese_paths() is used here for negative cycle detection. 

Is there a better work-around?

Thanks,

Paul