Boost logo

Boost Users :

Subject: Re: [Boost-users] [BGL] Cannot use vertex indices managed through bundled properties with r_c_shortest_path if EdgeList is listS
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2013-09-04 16:57:46


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:
>>
>> 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&lt;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?
>
> 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


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net