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? <br><br><div class="gmail_quote">On Sat, Mar 6, 2010 at 1:21 PM, Theodore McCormack <span dir="ltr">&lt;<a href="mailto:guzbit@gmail.com">guzbit@gmail.com</a>&gt;</span> wrote:<br>

<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hello all, <div>I am trying to iterate through a list of edges in the boost graph library, but i would like to advance more than one at a time or be able to use random access to an edge in the set. For example:</div>

<div><br>
</div><div>Currently, to find the edge at index in the edge set I have to iterate through all the edges:</div><div><div><br></div><div>Edge e;</div><div>int count = 0;</div><div>for (edge_range_t er = edges(graph); er.first != er.second; er.first++)</div>


<div>{<span style="white-space:pre">	</span></div><div><span style="white-space:pre">	</span>e = (*er.first);</div><div><span style="white-space:pre">	</span>if (count == index)</div>
<div><span style="white-space:pre">		</span>break;</div><div><span style="white-space:pre">	</span>count++;</div><div>}</div><div>return e;</div><div><br></div><div>I would like something like:</div>
<div><br></div><div><div>Edge e;</div><div>edge_range_t er = edges(graph);</div><div>e = (*er[index].first);</div><div>return e;</div><div><br></div><div>Is there a way to index with iterators?</div><div><br></div><div>Regards</div>


<div><br></div></div></div>
</blockquote></div><br>