[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] One degree Neighbors()

From: Håvard Wahl Kongsgård
Subject: Re: [igraph] One degree Neighbors()
Date: Thu, 20 Oct 2011 16:58:24 +0200

Thanks, will do it manually. However, this is something that should be
added to igraph.


On Thu, Oct 20, 2011 at 11:10 AM, Tamas Nepusz <address@hidden> wrote:
>> 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.
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

[Prev in Thread] Current Thread [Next in Thread]