Re: [Boost-users] boost graph in_edges

Subject: Re: [Boost-users] boost graph in_edges
From: Peter Neher (pneher_at_[hidden])
Date: 2011-04-23 12:03:45

hi, you were right. was not a bgl bug. but i have another question. is there a max flow algorithm in boost that works with a bidirectional graph instead of a directed graph? 

Am 20.04.2011 um 19:40 schrieb Jeremiah Willcock:

> On Wed, 20 Apr 2011, Peter Neher wrote:
> 
>> hi,
>> i'm using the boost graph library and i'm trying to find the incident edges of one vertex of the following graph:
>>     typedef boost::adjacency_list<
>>         boost::vecS,                //  The container used for egdes
>>         boost::vecS,                //  The container used for vertices
>>         boost::bidirectionalS,      //  bidirectional edges
>>         Vertex,                     //  The type that describes a Vertex.
>>         Edge                        //  The type that describes an Edge
>>     > Graph;
>> if i try to find the incident edges now, the message "Interpolation failed" is printed. any suggestions?
>> here the code to find the incident edges:
>>     Graph::in_edge_iterator edgeIt, edgeEnd;
>>    tie(edgeIt, edgeEnd) = in_edges(vID, m_Graph);
> 
> That message does not look like something that would have come from BGL. Is there some other code printing out that error?
> 
> -- Jeremiah Willcock_______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users