Re: [Boost-users] [BGL]Repost? Problems in the shortest pair algorithms.

From: Janusz Piwowarski (jpiw_at_[hidden])
Date: 2006-02-21 04:54:05

Peter Gerell wrote:
> However, the problems I have noticed are:
>  Floyd-Warshall:
>    1. std::min is used instead of the functor passed to as teh
> distance_compare parameter at several places
>    2. The distance map is initialized with 0 instead of zero.
>
>  Johnson:
>    3. std::numeric_limits<DT>::max() is used instead of the
> distance_inf parameter.
>    4. The distance_combine and distance_compare parameters are not
> used. The bellman_ford_shortest_paths algorithm is called with
> std::less and closed_plus.

You're right, there exist problems you noticed. Are you able to fix it? If 
not, I can try to do it at the end of week.

-- 
Regards,
Janusz