similar to: path matrix

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

On Sun, Jan 11, 2015 at 7:43 PM, Tobias Klausmann <tobias.johannes.klausmann at mni.thm.de> wrote: > > > On 11.01.2015 06:05, Ilia Mirkin wrote: >> >> Can you elaborate a bit as to why that's the right thing to do? >> >> On Wed, Jan 7, 2015 at 1:52 PM, Tobias Klausmann >> <tobias.johannes.klausmann at mni.thm.de> wrote: >>>

On 11.01.2015 06:05, Ilia Mirkin wrote: > Can you elaborate a bit as to why that's the right thing to do? > > On Wed, Jan 7, 2015 at 1:52 PM, Tobias Klausmann > <tobias.johannes.klausmann at mni.thm.de> wrote: >> If we capture transform feedback from n stream in (n-1) buffers we face a >> NULL buffer, use the buffer (n-1) to capture the output of stream n.

On 12.01.2015 01:57, Ilia Mirkin wrote: > On Sun, Jan 11, 2015 at 7:43 PM, Tobias Klausmann > <tobias.johannes.klausmann at mni.thm.de> wrote: >> >> On 11.01.2015 06:05, Ilia Mirkin wrote: >>> Can you elaborate a bit as to why that's the right thing to do? >>> >>> On Wed, Jan 7, 2015 at 1:52 PM, Tobias Klausmann >>>

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.

Hey all, I'm looking for a plotting method for two-mode networks. Having a n x m matrix where n is the first set of entities/ actors and m representing the second set, I want to colour both sets of actors differently. I tried "plot.network" from the network-package, but I did not succeed. Even the proposed solution from Gabor Grothendiek

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, 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

https://bugs.freedesktop.org/show_bug.cgi?id=66642 Priority: medium Bug ID: 66642 Assignee: nouveau at lists.freedesktop.org Summary: [nva5] Wrong provoking vertex is selected for flat attribute interpolation (clipping?) Severity: normal Classification: Unclassified OS: Linux (All) Reporter:

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

Dear community Find enclosed the full working example. Many thanks Sibylle Test_cat.csv Names Subcategory_type sources.cyto source Factor A.A material "A" A 1 B.B material "B" B 1 C.C regulation "C" C 1 D.D regulation "D" D 1 E.E habitat "E" E 1 F.F cultural "F" F 1 Test_adjac.csv

Hi, this seems to work (assuming that your problem was the setting of colours...): --- snip --- network %>% ggraph(., layout = "auto") + # This produces an error... # geom_edge_arc(curvature=0.3, aes(width=(E(network)$weight/10), color=c("darkblue", "red")[as.factor(edge_list$relationship)], alpha=0.5)) + # ... this works :-)

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

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

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

http://bugs.freedesktop.org/show_bug.cgi?id=25806 Summary: NV40 vertex corruption (kernel BO deletion too early?) Product: Mesa Version: git Platform: Other OS/Version: All Status: NEW Severity: normal Priority: medium Component: Drivers/DRI/nouveau AssignedTo: nouveau at lists.freedesktop.org

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 <-