[igraph] Storage of undirected links

[Thomas Gorochowski]

Hi there,

If I have an undirected graph and iterate through every eid will this lead to 2 
edges being returned if nodes i and j are connected, i.e. (i, j) and (j, i), or 
does the iterator only return a single edge in this scenario.

Many thanks,

Tom

-- 
T.E. Gorochowski
University of Bristol, Centre for Complexity Sciences (BCCS)
http://www.chofski.co.uk, address@hidden