|
|
Boost Users : |
Subject: Re: [Boost-users] Graph Library Random Access Iterators?
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-03-06 13:58:17
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 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