Re: [Boost-users] [BGL] Is adjacency_iterator not Equality Comparable?

Subject: Re: [Boost-users] [BGL] Is adjacency_iterator not Equality Comparable?
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-05-18 13:50:30

On Tue, 18 May 2010, Hossein Haeri wrote:

> Dear all,
>
> [Boost 1.42, GCC 3.4.5 under MinGW in WinXP]
>
> I have a piece of program like this:
>
> typedef graph_type::adjacency_iterator iterator;
> iterator begin, end;
> boost::tie(begin, end) = boost::adjacent_vertices(curr_, *graph_ptr_);
> //...
> ArrFreq nextArr = l.front();
> //...
> iterator i = find(begin, end, nextArr);
>
> And, I get the error message in the P.S. once I try the last line above. I was wondering if that's because:
>
> 1) adjacency_iterator is not equality comparable. Or,
> 2) the value type of adjacency_iterator is not comparable with the graph's vertex type. Or,
> 3) even something else?

Could you please send a complete program that I can try to compile here? 
GCC 3.4.5 is old and I'd like to see if the issue occurs on newer 
versions.

-- Jeremiah Willcock