similar to: R igraph clusters component

Displaying 20 results from an estimated 2000 matches similar to: "R igraph clusters component"

2012 Jul 11
1
igraph function "graph.bfs" unavailable
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
2016 Sep 06
2
igraph V a partir de E y subgrafos
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
2011 May 05
1
Looping over graphs in igraph
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
2012 Apr 23
1
Add attributes to igraph vector by name, not index
Hi, So I've been figuring out how to use igraph in R and like it for it's speed and simplicity. Now I have a graph built from an edgelist where vectors have a $name attribute. I have another dataframe with attributes tied to a vector ID, which is the same as the $name attribute of vectors represented in the graph. How can I iterate over the graph by V(g)$name and do
2016 Sep 03
2
igraph V a partir de E y subgrafos
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
2009 Apr 06
2
Bonpower Crashes Trying Sparse Matrix (Igraph)
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
2007 Mar 16
1
Fast lookup in ragged array
Hello, I'm running an algorithm for graph structural cohesion that requires a depth-first search of subgraphs of a rather large network. The algorithm will necessarily be redundant in the subgraphs it recurses to, so to speed up the process I implemented a check at each subgraph to see if it's been searched already. This algorithm is very slow, and takes days to complete on a
2011 Apr 15
1
Can't use attributes from gml file in Cytoscape
Hello, I am exporting a graph in "gml" format from igraph 0.5.5. When I open the file in Cytoscape v.2.7 I can't map the color attribute that I assign to the graph when I export it from igraph. Could anyone help me in this? Thanks. -- Warm Regards, Sandeep Amberkar BioQuant,BQ26, Im Neuenheimer Feld 267, D-69120,Heidelberg Tel: +49-6221-5451354 [[alternative HTML version
2007 Oct 09
3
igraph and plotting connected components
Hello there, I am using the igraph package to build graphs from my data. If I plot a graph though, it's not easy for me to see what's going on. Does anybody know how to rearrange a graph to get a plot without too many crossing lines? Maybe other packages? Thanks a lot in advance for any pointers, -- D --------------------------------- [[alternative
2009 May 15
1
Matrix package,solve() errors and crashes Please help
> > Hello All, > Please help me with this problem.I have been having this problem for over a month now and I could not find any information.I later realised that error is with MATRIX package. I am working on graph object using IGRAPH version 0.5.2-2 package & wanted to do Bonacich Power. What I have is undirected GRAPH. This is my graph object. The file 'Bonacich
2008 Nov 27
1
Welcome to the "R-help" mailing list (Digest mode)
Hi friends, Is there anyone who happened to import data set in the "DL" format into R for further analysis? In the package of "network", there's only a method named "read.paj()". So now, I have to get the dl file from the original data set, and use UCINET to convert it to .net file. It's too complicated. :( In the package of "igraph", edgelist is
2012 Aug 14
2
igraph: Turn multiple edges into weights
Dear all, I have some network data - about 300 vertices and several thousand edges. I am looking for a way to turn multiple edges into weights of the edges. I looked around and - surprisingly? - haven't found anything. Is there an easy way to do this? Best, Jonas [[alternative HTML version deleted]]
2009 Feb 04
1
igraph: error when setting size and shape of vertices
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
2011 Jan 05
1
unique limited to 536870912
Hi I am using R with igraph to analyze an edgelist that is greater than the said amount. Does anyone know a way around this? Thanks Inder
2011 May 18
1
data network format and grouping analysis
Hi everyone, I have a dataset of friendship with this format: ego alter 4746 1 2 9742 1 3 14738 1 NA 4747 2 NA 9743 2 3 14739 2 1 4748 3 13 9744 3 5 14740 3 14 4749 4 NA 9745 4 NA 14741 4 NA 4750 5 NA 9746 5 13 14742 5 10 4751 6 12 9747 6 7 ... NA means that individuals don't select any
2011 Nov 06
1
Request for Help: y-axis label overlapped by x-axis in subplots in big plot
Dear All, I would like to seek for help on this issue: 1. I set par(mfrow=c(2,2)), hoping to plot 4 subgraphs in a whole graph 2. Each subgraph has its own x,y axes and each has x-axis label and y-axis label 3. moreover, subgraphs in the left column of the whole graph are all 3D, and have z axes and labels for z axes 4. subgraphs in the right column of the whole graph are all 2D 5. In each
2009 Apr 20
1
Matrix package,solve() errors and crashes
Hello All, I am working on graph object using IGRAPH package wanted to do Bonacich Power. This is my graph object. The file 'Graph.RData' (4.2 MB) is available for download at http://dropbox.unl.edu/uploads/20090424/cfe4fcb854bb17f2/Graph.RData Graph size Vertices: 20984 Edges: 326033 Directed: FALSE No graph attributes. Vertex attributes: name. No edge attributes. When I use
2011 Apr 09
3
Converting edgelist to symmetric matrix
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
2011 Jul 14
1
recursive function - finding connections
Dear all, I'm having some problems getting my recursive function to work. At first I though that maybe my data was too big and I increase option(expressions=50000). Then I thought that I would try it on some smaller data. Still not working. :( I would have thought there should be a function for this already, so any suggestions are welcomed for other methods. I did try igraph but couldn't
2008 Dec 26
2
question about SNA in R, thanks!
Dear colleagues, I'm trying to have a look at the Assortative and Disassortative ( http://en.wikipedia.org/wiki/Assortative_mixing) of the network I have. But it seems that the igraph hasn't mentioned that yet. I have to get the in/out degree of the vertices of each edge and calculate the Pearson's Correlation coefficient which seems to be quite a huge task for me. :( So I wonder if