From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2007-05-29 10:20:20
On Mon, 2007-05-28 at 12:37 +0000, Nicolas Ray wrote:
> Hello all,
>
> I have developed an application using the dijkstra_shortest_paths function of
> the Graph library of version 1.31 of Boost. When upgrading to Boost version
> 1.34, I have the following compilation error under Borland C++ Builder 6:
>
> [C++ Error] relaxed_heap.hpp(52): E2247'relaxed_heap<unsigned int,
> indirect_cmp<float*,less<float>>,vec_adj_list_vertex_id_map<VertexProperty,
> unsigned int>>::largest_key' is not accessible
Oops, this looks like a bug in the relaxed_heap code. Please add
friend struct group;
at line 88 of relaxed_heap.hpp (right after the definition of the
"group" struct), which should fix the problem.
- Doug