On Wed, 4 Sep 2013, Jeremiah Willcock wrote:
On Wed, 4 Sep 2013, potato_research wrote:
As per the thread topic. Given the following minimal (not-)working example:
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
::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
to
adjacency_list
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?
It is supposed to work, and it is a bug that it did not for you. Please see if r85567 of the trunk fixes the problem.
Would you mind if I added your code as a test case for BGL? If you're fine with that, could you please attach a Boost license statement to it? Thanks. -- Jeremiah Willcock