Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?

See the post of Jan de Ruiter. Seems he has discovered a bug with johnson_all_shortest_paths. And Johnson uses bellman_ford. I think we should notify the BGL developers of these problem. Please post your problem on the boost.devel newsgroup. Sadly, i have to use MSVC, so i'm unable to compile johnson... since there is no unnamed version yet.