[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[igraph] Storage of undirected links
From: |
Thomas Gorochowski |
Subject: |
[igraph] Storage of undirected links |
Date: |
Sun, 23 May 2010 15:34:26 +0100 |
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
- [igraph] Storage of undirected links,
Thomas Gorochowski <=