|
Boost Users : |
Subject: Re: [Boost-users] Graph Library Random Access Iterators?
From: Theodore McCormack (guzbit_at_[hidden])
Date: 2010-03-06 14:03:38
Thank you Jeremiah for the prompt reply. I have put vecS in the last
template arguement. How would i access the edge list after doing so?
On Sat, Mar 6, 2010 at 7:58 PM, Jeremiah Willcock <jewillco_at_[hidden]>wrote:
> On Sat, 6 Mar 2010, Theodore McCormack wrote:
>
> I need to use mutability in my graph. How would you use the vecS in the
>> EdgeList for adjacency_list in a random access fashion?
>>
>
> Use vecS as the last template argument to adjacency_list and see if that
> gives you random access.
>
> -- Jeremiah Willcock
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>
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