similar to: igraph question

Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS

Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

Hi, I'm trying to do some basic social network analysis with igraph in R, but I'm new to R and haven't been able to find documentation on a couple basic things: I want to run igraph's community detection algorithms on a couple thousand small graphs but don't know how to automate igraph looking at multiple graphs described in a single csv file. My data look like something in

igraph is a package for graphs/networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. LINKS Release notes for the 0.5.2 version: http://igraph.sourceforge.net/relnotes-0.5.2.html Release notes for the 0.5.1 version: http://igraph.sourceforge.net/relnotes-0.5.1.html Complete list of changes: http://igraph.sourceforge.net/news.html The

igraph is a package for graphs/networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. LINKS Release notes for the 0.5.2 version: http://igraph.sourceforge.net/relnotes-0.5.2.html Release notes for the 0.5.1 version: http://igraph.sourceforge.net/relnotes-0.5.1.html Complete list of changes: http://igraph.sourceforge.net/news.html The

I am having trouble plotting one of my graphs (think graph theory graph with edges and vertices, not scatterplots or histograms). For some pairs of vertices, I want multiple edges to be visible in my graph. As an example of this, in my script below, I want two edges to be visible from vertex 1 and vertex 9 (among some others) yet when I plot it, only one edge is visible.

Hello All, I have been trying to do bonpow for a while now.Bonpow works for few graphs and for few others it goes out of memory. I did see reply to one of the posting Alph Centrality Crashed in Igraph memory error. The solution in the posting was to use sparse matrix. This is the link of the message. http://lists.gnu.org/archive/html/igraph-help/2008-04/msg00071.html I was able to obtain

When the shape of all vertices is set to "square" and the size of the vertices is also set, one get following error (commands attached): Error in l[[which.min(sapply(l, function(p) (p[1] - x0)^2 + (p[2] - y0)^2))]] : attempt to select less than one element Is there a way to solve this problem? Robbie ## Load the igraph package library(igraph) ## Create and plot a small graph

Hi, what does this mean? --8<---------------cut here---------------start------------->8--- > graph <- graph.data.frame(merged[!v,], vertices=ve, directed=FALSE) cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't data.table aware cedta decided 'igraph' wasn't

Hello... I am a system engeenering student and I am using R for first time for Graph Theory. I would like to know if there is anyway you can plot an ghaph (igraph library) and obtain a graph whose vertices dont appear identified with number, instead I would like the vertices to be identified with letters or words, names... is there anyway I can do this? Thanks in Advance for your

Hi Petr, The following is different line of thought which is posted in different form, maybe you have some wise input on it. "I need to find Efficient(tracktable) deterministic algorithm for Matching Weighted Graphs with bounded degree. Now we all know Graph matching is non-tractable but when degree of vertex has upper bound are there any tractable algorithm? Does this special case comes

Hi, I'm working on some social networks and I managed to create the graphs with labels and edges weight, but I would also like to change the size of the vertices according to the age of the persons in the network and the shape according to the gender. Now for the age, I have people with ages between 20 and 78, and I would like to have 4 categories (sizes): 20-35, 36-50, 50-65, >65. I have

Hello R users, I've just defended my PhD dissertation, and I'm engaging in discussions with the "ruler lady". She has some problems with my figures. The problem is that my nodes overlap the text that I've put inside of them. Here is a url for the figure: https://www.msu.edu/~wolfste4/igraph/sorter34_graphvfr.pdf (As you can see, the cluster at the center left of

Dear all, I am using the package igraph and try to use the neighbors() function. I am a bit confused, see the following : Given a graph g with 18 vertices. Names of the vertices are indicated by : > V(irt.graph)$name [1] "AT2G41240" "AT3G13610" "AT3G02470" "AT3G30775" "AT3G18290" "AT4G13770" "AT1G01580"

Dear all, I'm doing some experiments with igraph and in particular with graph layouts. I can't figure out how to apply a layout to a given (real) graph avoiding node overlaps. In the following example if the variable NumOfNodes is setted to a small value (10) the layout function generates a plot without node overlaps. But even with a not-so-big number of nodes (50) plotted graph has

Estimados Copio un mensaje de error que da igraph, es más fácil verlo que explicarlo. > fastgreedy.community(udatos) Error in .Call("R_igraph_community_fastgreedy", graph, as.logical(merges), : At fast_community.c:553 : fast-greedy community finding works only on graphs without multiple edges, Invalid value > cluster_louvain(udatos) IGRAPH clustering multi level, groups: 7,

Hi everyone! I would appreciate help with using decompose.graph(), community detection functions from igraph and lapply(). I have an igraph object G with vertex attribute "label" and edge attribute "weight". I want to calculate community memberships using different functions from igraph, for simplicity let it be "walktrap.community". This graph is not connected,

Estimados, estoy ?jugando? con unos datos clínicos donde realizo un análisis de redes, utilicé igraph como nerwork, pero finalmente uso igraph (creo que tiene más opciónes). Son algo de 200 nodos y algo más de 2000 relaciones. Puedo graficarlos. Los datos están de la siguiente forma, por ejemplo, individuo, patología, (las dos primeras columnas son la relación), luego un fármaco, el grupo