Boost Users :

Date view	Thread view	Subject view	Author view

From: Matthias Kronenberger (mkronen_at_[hidden])
Date: 2002-07-25 10:00:41

Next message: Jeremy Siek: "Re: [Boost-Users] Re: BGL: traversal algorithm for tree"
Previous message: Matthias Kronenberger: "Re: BGL and reversing / moving edges"
In reply to: Louis Lavery: "Is bellman_ford_shortest_paths supposed to work for undirected graphs?"
Next in thread: Jeremy Siek: "Re: [Boost-Users] Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?"
Reply: Jeremy Siek: "Re: [Boost-Users] 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.

Next message: Jeremy Siek: "Re: [Boost-Users] Re: BGL: traversal algorithm for tree"
Previous message: Matthias Kronenberger: "Re: BGL and reversing / moving edges"
In reply to: Louis Lavery: "Is bellman_ford_shortest_paths supposed to work for undirected graphs?"
Next in thread: Jeremy Siek: "Re: [Boost-Users] Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?"
Reply: Jeremy Siek: "Re: [Boost-Users] Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?"

Date view	Thread view	Subject view	Author view

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