Re: [Boost-users] Buggy Prim's minimum spanning tree example

From: Olivier Delalleau (delallea_at_[hidden])
Date: 2006-02-27 16:56:16

> > OS = Fedora Core 4: 'uname -a' -> Linux xxx.yyy 2.6.15-1.1831_FC4 #1 
> > SMP Tue
> > Feb 7 13:37:59 EST 2006 x86_64 x86_64 x86_64 GNU/Linux
> >
> > g++ --version -> g++ (GCC) 4.0.2 20051125 (Red Hat 4.0.2-8)
> >
> > Boost version is 1.33.0.
> 
> I think this is the problem. We ran into a bug in the relaxed heap code 
> (used by Prim's algorithm) on x86 Linux in 1.33.0. The bug exhibited 
> similar problems to what you're seeing. The fix is in Boost 1.33.1; I 
> recommend you try upgrading Boost.

Thank you very much, it indeed solved the problem. I had quickly browsed
through the change list in 1.33.1 before posting, but obviously I went
too fast since I hadn't noticed the Graph library in the list (note: an
alphabetical ordering may help).

Thanks again!

--
Olivier