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,vec_adj_list_vertex_id_map>::largest_key' is not accessible
If I comment the call to the "dijkstra_shortest_paths" function in my code,
there is no compilation error anymore. Is it related to how the default
vertex_index is defined? If I add and use a custom vertex_index in the vertex
property map, I get the same compilation error. I have tried to compile with
version 1.33 and add the same error.
I defined my graph as follow:
struct vertex_altitude_t {typedef vertex_property_tag kind;};
typedef property VertexProperty;
typedef property EdgeProperty;
typedef adjacency_list Graph;
Any help would be greatly appreciated,
thank you very much,
nicolas
