Hi, All!
I am newbie in boost.
The code fragment compiled without errors with boost 1.48.0 in MS Visual Studio
2008 ,
but returns compiler error with boost 1.49 and 1.50 :
error C2784: 'E
boost::detail::get(boost::detail::underlying_edge_desc_map_type<E>,
const boost::detail::reverse_graph_edge_descriptor<EdgeDesc> &)' :
could not deduce template argument for
'boost::detail::underlying_edge_desc_map_type<E>' from 'double *'
c:\program files\boost\boost_1_50_0\boost\graph\dijkstra_shortest_paths.hpp
140 .
typedef boost::adjacency_list > Graph;
Graph g(100);
typedef graph_traits < Graph >::vertex_descriptor vertex_descriptor;
typedef graph_traits< Graph >::edge_descriptor edge_descriptor;
property_map< Graph, edge_weight_t>::type weightmap = get(edge_weight,
g);
/* graph filling code */
std::vector predesessor(num_vertices(g));
std::vector<double> distances(num_vertices(g));
vertex_descriptor startV = vertex(startIx, g);
property_map::type indexmap = get(vertex_index,
g);
dijkstra_shortest_paths(g,startV,&predesessor[0],&distances[0],
weightmap,
indexmap,
std::less<double>(), closed_plus<double>(),
(std::numeric_limits<double>::max)(), 0,
default_dijkstra_visitor());
WBW&R, Gregory
