similar to: Plotting network without overlapping vertices

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.

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

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 plotting a graph with kamada.kawai layout. But I am getting direction arrows in the graphs. Please let me know how to avoid this. g <- watts.strogatz.game(1, 2000, 5, 0.4) comps <- clusters(g)$membership colbar <- rainbow(max(comps)+1) V(g)$color <- colbar[comps+1] png(filename) plot(g, layout=layout.kamada.kawai, vertex.size=2, vertex.label=NA) dev.off() Please find

Hi, I would like to be able to develop a function to plot an igraph object with lattice (trellis type displays will be usefull for grouping etc). Anyway, I mostly feeble Igraph requires that you convert two columns of data two an igraph object and to be able to plot the graph...I have tried a very, very simplistic (if not naive) approach and surprise, surprise, it didn't work. First of all,

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

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

Dear all, I have a directed graph - an Igraph to be more precise - which has some vertices attributes (like dorm, year etc). Edges and the graph itself do not have any attributes. Based on the attributes of the vertices, I'd like to calculate correlation among the edges (e.g. how likely people of the same dorm are connected?) for the whole graph. Also, I'd like to calculate

Dear R users, I am trying to draw a network using igraph package. I intend to place the hub nodes (the ones with the relatively more connection with other nodes) in the center of the graph. Also, the graph need to be in the fashion that the higher the correlation between two nodes is , the closer the two nodes will be. Is there any layout that can help or any other way to do this? Thanks in

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

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

Alberto, you simply need a font that has those characters. For example on 10.6 this works: plot.new(); plot.window(0:1,0:1); text(0.5,0.5,"??",cex=10,family="Hei") You may want to check your system for fonts that you can use (those that have chinese characters when you click on them in Font Book). There are a lot of fonts that work like STSong, STFangsong, LiSong Pro,

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

I have a number of (directed) graphs based on social groups, where the members have expresed likes and dislikes in respect to the other members. tkgraph makes it simple to draw the graphs in a very pleasing way, but I would like to differentiate between positive and negative relations in the graph by having the edges for the negative relations dashed and the positive ones continuous. Is

Hi, I have data on individuals (B) who participated in events (A). If ALL participants in an event are a subset of the participants in another event I would like to remove the smaller event and if the participants in one event are exactly similar to the participants in another event I would like to remove one of the events (I don't care which one). The following example does that however it

hmm... your cut-and-paste looks like ascii, but is the cuesheet in utf-8? --- Ariel Arelovich <aarelovich@gmail.com> wrote: > Hollo I'm new, My name is Ariel Arelovich > > I've encountered the following problem trying to sue metaflac. I used > the > following command: > > c:\Archivos de programa\FLAC>metaflac >