[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Finding reciprocal node pairs in medium/large graphs
From: |
Jeff Hemsley |
Subject: |
Re: [igraph] Finding reciprocal node pairs in medium/large graphs |
Date: |
Sat, 16 Feb 2013 14:34:42 -0800 |
Perfect!
Thank you!
On Sat, Feb 16, 2013 at 2:15 PM, Tamás Nepusz <address@hidden> wrote:
>> How can I get a list (or vector, or df) containing all of the
>> reciprocal node pairs?
> See ?is.mutual; e.g.:
>
>> el <- get.edgelist(g)
>> el[is.mutual(g), ]
>
> This gives you the subset of the edge list corresponding to mutual edges. If
> you are interested in the indices of mutual edges, use which(is.mutual(g))
>
> --
> T.
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
--
Jeff Hemsley
Doctoral Candidate
The Information School
University of Washington
http://staff.washington.edu/jhemsley/
http://somelab.net/author/jhemsley/
address@hidden