Boost Users :
Subject: [Boost-users] Performance issues with bellman_ford_shortest_paths
From: Paul De La Musica (paul.delamusica_at_[hidden])
Date: 2009-05-13 21:21:32
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?
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