Re: [Boost-users] [Graph] Problems with in-edges for a user defined AdjacencyList

Subject: Re: [Boost-users] [Graph] Problems with in-edges for a user defined AdjacencyList
From: Berit Løfstedt (blof_at_[hidden])
Date: 2010-07-31 15:38:59

Thanks - that resolved the issue :-)

Best Regards,

 
Berit Løfstedt

PhD. Student

DTU Management Engineering, Operations Research
 

Technical University of Denmark

        
Department of Management Engineering
Produktionstorvet, Bygning 426
2800  Kgs. Lyngby
blof_at_[hidden] <mailto:blof_at_[hidden]>
www.or.man.dtu.dk <http://www.or.man.dtu.dk>

 

Jeremiah Willcock wrote:
> On Fri, 30 Jul 2010, Berit Løfstedt wrote:
>
>   
>> Hi,
>>
>> I am fairly new to boost and I have a problem using the in_edges(v, G) 
>> function.
>>
>> I have defined a graph of type AdjacencyList:
>> typedef adjacency_list<
>> vecS,
>> vecS,
>> directedS,
>> VertexProperties,
>> EdgeProperties
>>     
>>> mcf_graph;
>>>       
>
> (snip)
>
>   
>> produces the error:
>> error: no matching function for call to 'in_edges(vertex_descriptor&, 
>> mcf_graph&)'
>>
>> The problem does not occur for out_edges. From the examples I have seen 
>> AdjacencyList should support both functions. Can anybody explain to me why 
>> in_edges do not work for this example?
>>     
>
> The AdjancencyList concept only requires out_edges().  If you want 
> in_edges(), your graph must be specified with bidirectionalS rather than 
> directedS as the directedness category.
>
> -- Jeremiah Willcock