similar to: Subgraph isomorphism using vertex labels

I am getting some unexpected results from some functions of igraph and it is possible that I am misinterpreting the vertex numbers. Eg., the max betweenness measure seems to be from a vertex that is not connected to a single other vertex. Below if my code snippet: require(igraph) my.graph <- graph.adjacency(adjmatrix = my.adj.matrix, mode=c("undirected")) most.between.vert <-

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

I have a graph with edge and vertex weights, stored in two data frames: --8<---------------cut here---------------start------------->8--- vertices <- data.frame(vertex=c("a","b","c","d"),weight=c(1,2,1,3)) edges <-

Dear r-help, I create a graph of my baysian network. I use the package igraph. The names of vertex are within the circle, I would leave them outside the circle? > E(g)$color <- "black" > tkplot(g, ,vertex.label=names,layout=layout.kamada.kawai, edge.color=E(g)$color) Best Regards [[alternative HTML version deleted]]

Estimados Tengo un problema. Con igraph creo una red a partir de un data.frame, las dos primeras columnas son V y las restantes E. Hay un trabajo anterior, yo me pregunté ¿Qué pasaría si las cosas hablaran entre ellas?, entonces hay un cruce de información de todos contra todos y elimino los nulos y duplicados. Al ver los listados E, V tienen la información. Hasta ahí estaría todo bien (me

Estimado Javier, Me alegra que hayas avanzado con tu error. Te respondo a esto último. La función induced.subgraph() espera como segundo parámetro una lista de los IDs de los vértices, mientras que tú le estás pasando una lista de 'edges'. Prueba lo siguiente: c <- induced.subgraph(datos.network, which(V(datos.network)$name == 'Casa')) Si entendí bien todo, debería

Hi everyone, I have successfully created and analyzed my network data. I am new to R, and Network Analysis too, but I want to color my vertex based on some of the centrality measures calculated. Can someone point me in the right direction? Again, I am new to R, but given how powerful R appears to be, I figure this is probably pretty easy to do, I just wish I could figure it out. Many thanks

Using Igraph, I create shortest paths, then convert the matrix into three column vectors - "vertex1", "vertex2", "shortestpath" - as the code below shows. #code for generating shortest path matrix and creating a 3 columns from an igraph graph object "y" y_s<-shortest.paths(y, weights = NULL) y_s <- melt(y_s)[melt(upper.tri(y_s))$value,] #Step 2: this

Hi, I've installed the igraph package and have been otherwise using it successfully, but when I try to use graph.bfs I get the error: could not find function "graph.bfs" Moreover, I don't seem to have the documentation installed either. (per ?graph.bfs and ??graph.bfs). I'm using RStudio v0.95.262 on windows 7. Below is the info for my R build: R version 2.14.0

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

> > > > Also as a side note, I think in the original MachineOutliner RFC thread > there was some confusion as to whether it was possible to solve the code > folding outlining problem exactly as a graph problem on SSA using standard > value numbering algorithms in polynomial time. > > I can elaborate further, but > 1. it is easy to see that you can map an arbitrary

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

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.

Hi, I have network data in the form of a couple of edgelists containing weights in the format "x,y,weight" whereby x represents row header and y represents column header. All edgelists are based on links among 634 nodes and I need to convert them into a 634*634 weighted matrix. I searched for online help using possible keywords I know, but I could not find a clue how to do this 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

Hi, I am using 'igraph' to make some plots. The problem I got is that I don't know how to label the nodes with gene names. My sample code: ## suppose I have 100 gene (nodes) ## --------------------------------------------------------------------------- graph <- set.vertex.attribute(graph, "color", value=c(rep(c('green','red'),50))) graph <-

I realize that matrix indexing has been addressed in various flavors, but I''m stumped and didn''t find anything in the archives. It''s not clear if it is an igraph issue or a more general problem. Thanks in advance for your patience. I am using igraph to read a gml file (http://www-personal.umich.edu/~mejn/netdata/football.zip ). The gml file contains vertex attributes