Re: [Boost-Users] Re: Is bellman_ford_shortest_paths supposed to work for undirected graphs?

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-07-25 15:39:52

Hi Matthias,

On Thu, 25 Jul 2002, Matthias Kronenberger wrote:
mkrone>
mkrone> Sadly, i have to use MSVC, so i'm unable to compile johnson...
mkrone> since there is no unnamed version yet.

I've checked in an unnamed version of the Johnson all-pairs shortest path
algorithm. However, I have not yet tested it with MSVC.

Regards,
Jeremy

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------