[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Re: Calculating measures for a bunch of ego-networks
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Re: Calculating measures for a bunch of ego-networks |
Date: |
Thu, 6 May 2010 14:34:01 +0200 |
Magnus,
you can try the 0.6 development version, it has some improvements for
V() and E() and also for %--%. You can download it from
http://code.google.com/p/igraph/downloads/list
If you want all edges that connect two vertex sets, and your graph is
not changing much, then you can query the edge list of the graph and
extract the edges from there:
el <- get.edgelist(G)
which(el[,1] %in% myfrom & el[,2] %in% myto)-1
On a second thought, this is more or less what %--% is doing, so I am
not sure that it will be any faster.
Please tell me if the 0.6 version solves your problem. Thanks,
G.
On Thu, May 6, 2010 at 1:01 PM, Tamas Nepusz <address@hidden> wrote:
> Hi Magnus,
>
> Sorry, I've just seen your new message and it looks like you have
> already figured out what I said in my earlier email. I'm not that
> familiar with the internals of the R interface, so I cannot comment on
> the performance penalty of the %--% operator that you see -- let's hope
> Gabor can say more about that.
>
> --
> Tamas
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
--
Gabor Csardi <address@hidden> UNIL DGM
Re: [igraph] Calculating measures for a bunch of ego-networks, Tamas Nepusz, 2010/05/06