As per the thread topic. Given the following minimal (not-)working example: http://pastebin.com/6zpwCb4X I receive the following compilation error: /usr/local/include/boost/graph/r_c_shortest_paths.hpp:244:50: error: invalid conversion from 'boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexProperty, EdgeProperty>
::vertex_descriptor {aka void*}' to 'int' [-fpermissive] int i_cur_resident_vertex_num = cur_label->resident_vertex;
If I change my graph from: adjacency_list<listS, listS, bidirectionalS, VertexProperty, EdgeProperty> to adjacency_list<listS, vecS, bidirectionalS, VertexProperty, EdgeProperty> everything seems to be working fine. However, I need to use listS in my code for iterator validity purposes. Is it possible to use r_c_shortest_paths with a graph with listS EdgeList? If so, how? Thanks. -- View this message in context: http://boost.2283326.n4.nabble.com/BGL-Cannot-use-vertex-indices-managed-thr... Sent from the Boost - Users mailing list archive at Nabble.com.