Re: [R] vertex labels in igraph from adjacency matrix

From: Gabor Csardi <csardi_at_rmki.kfki.hu>
Date: Wed, 05 Mar 2008 09:45:38 +0100

On Wed, Mar 05, 2008 at 02:27:21AM -0500, Charilaos Skiadas wrote: [...]
>
> Btw, you will likely want to take the betweenness call out, and call
> it once and store the result, instead of calling it twice (well,
> assuming the graph is largish). Or even better, use which.max:
>
> which.max(betweenness(graph = my.graph, v=V(my.graph), directed =
> FALSE))
This is almost good, but there is a catch, in igraph vertices are numbered from zero. So if you want an igraph vertex id, then you need to subtract one from this, i.e.:

maxb <- which.max(betweennness(my.graph, directed=FALSE))-1

You can double check it:

betweenness(my.graph, maxb, directed=FALSE)

Gabor

PS. there is also an igraph mailing list, see the igraph homepage at igraph.sf.net

> Haris Skiadas
> Department of Mathematics and Computer Science
> Hanover College
>
[...]

-- 
Csardi Gabor <csardi_at_rmki.kfki.hu>    UNIL DGM

______________________________________________
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.
Received on Wed 05 Mar 2008 - 08:55:46 GMT

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Wed 05 Mar 2008 - 15:30:18 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.

list of date sections of archive