[Boost-users] Performance issues with bellman_ford_shortest_paths

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