Re: Johnsons BGL implementation for undirected graphs correct?

From: Jan de Ruiter (yg-boost-users_at_[hidden])
Date: 2002-07-23 04:26:42

Michael Kettner wrote:

> 
> Hi Jan,
> 
> as far as I can see the distance between node 9 and node 6 equals 12 and not 2 
> as you are assuming. So the result is 4+4+4+12+12 = 36 which is perfectly 
> correct.
> 
> Michael
> 

Hello Michael,

I don't think so. Look again at the source code and you'll see that 
Edge(6,9) has a corresponding weight of 2.

Jan de Ruiter