[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Storage of undirected links
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] Storage of undirected links |
|
Date: |
Mon, 24 May 2010 09:18:41 +0100 |
> 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.
The iterator only returns a single edge and it is unspecified whether you will
get (i, j) or (j, i).
--
Tamas