search for: tilford

...node overlaps. But even with a not-so-big number of nodes (50) plotted graph has almost all nodes overlapped by neighbors vertices. The problem gets even worst if I increase vertex size. # R code require(igraph) NumOfNodes <- 10 g <- barabasi.game(NumOfNodes) g$layout <- layout.reingold.tilford(g) plot(g) NumOfNodes <- 50 g <- barabasi.game(NumOfNodes) g$layout <- layout.reingold.tilford(g) plot(g) Actually I'm using GraphViz which has an option to avoid overlaps but I can't find something similar in igraph documentation. Can someone point me to the rigth direction ?...

Hi all, I'm very new to R and read a few tutorials, however I'm having difficulty trying to figure out how to plot a minimum spanning tree. I have a csv file that contains an n-by-n matrix of distances between strains of bacteria called matrix.csv. Looks like: id,strain1, strain2,strain3 strain1,0,.2,.8 strain2,.3,0,.7 strain3,.4,.6,0 I've been messing around with some information

I've been using sna to work with some networks, and am trying to visualize them easily. My networks are hierarchical (food webs). All of the layout engines I've tried with gplot don't seem to plot hierarchical networks, as one would using dot from graphviz. While I could do all of this by outputting to dotfiles and running it through graphviz, the graphics I get from R are much

...hat I had. Hrm. I don't know much about the algorithm graphviz uses for dot. Do you have a reference on hand? If it's simple, I'd be willing to take a whack at it. G?bor Cs?rdi-2 wrote: > > Jarrett, > > the 'igraph' package has a layout called layout.reingold.tilford that > is designed for trees, there is a slight chance that it is good enough > for you. > > Best, > Gabor > > On Wed, Apr 29, 2009 at 10:11 PM, jebyrnes <byrnes at msi.ucsb.edu> wrote: >> >> I've been using sna to work with some networks, and am trying...