[R] Highly Connected Nodes in Igraph

Gábor Csárdi csardi at rmki.kfki.hu
Fri Mar 6 19:09:37 CET 2009


if you have a weighted adjacency matrix, then you don't need graph
packages for this, just do



rowSums(data != 0)

depending you want the sum of the weights of the adjacent edges, or
just the number of adjacent edges. Or optionally colSums instead of
rowSums if your graph is directed.


On Fri, Mar 6, 2009 at 7:00 PM, Sur Nathan
<surendar.swaminathan at gmail.com> wrote:
> Hello R Help Team,
>  I have created graph from weighted adjecency matrix .Is there a way I can
> find highly connected nodes in Igraph like the Package RBGL does.
> nathan
> --
> View this message in context: http://www.nabble.com/Highly-Connected-Nodes-in-Igraph-tp22377522p22377522.html
> Sent from the R help mailing list archive at Nabble.com.
> ______________________________________________
> R-help at r-project.org mailing list
> 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.

Gabor Csardi <Gabor.Csardi at unil.ch>     UNIL DGM

More information about the R-help mailing list