Re: [Boost-users] Performance issues with bellman_ford_shortest_paths

paul wrote:

Paul De La Musica 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?

Did you compile with full optimizations? - Volodya