[R] k paths from a single vertex

Boris Steipe boris.steipe at utoronto.ca
Tue Jan 27 17:43:33 CET 2015

Does the igraph function neighborhood() not do what you need?

On Jan 27, 2015, at 7:22 AM, Manon Lily Ragonnet-cronin <Manon.Ragonnet at ed.ac.uk> wrote:

> Dear all,
> I am analysis networks using both igraph and network/ sna packages.
> I want to find all the nodes within 3 steps of a specific node but cannot find a function to do this. I know that kpath.census can generate tables for the entire network but my network is too large for this to be an viable solution (~7000 nodes and fully connected, so that I cannot break it down into clusters and analyse each cluster independently).
> Any ideas?
> Thanks very much,
> Manon
> -- 
> The University of Edinburgh is a charitable body, registered in
> Scotland, with registration number SC005336.
> ______________________________________________
> R-help at r-project.org mailing list -- To UNSUBSCRIBE and more, see
> https://stat.ethz.ch/mailman/listinfo/r-help
> PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
> and provide commented, minimal, self-contained, reproducible code.

More information about the R-help mailing list