[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] One degree Neighbors()
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] One degree Neighbors() |
|
Date: |
Thu, 20 Oct 2011 11:10:34 +0200 |
|
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:7.0.1) Gecko/20110929 Thunderbird/7.0.1 |
> Hi, with the trunk version of igraph the neighbors(mode='IN') function
> returns all predecessors. Is the result ordered by degree
There is no particular ordering in the result.
> or it's there a function which returns only one degree Neighbors().
No, there isn't; you may collect the one-degree nodes in advance into a set
and then intersect the set with the set of neighbors returned. (If you do it
only once, then it is probably more efficient to check the neighbors one by
one instead of creating a one-degree set in advance).
--
T.