Displaying 20 results from an estimated 1000 matches similar to: "igraph and tkgraph"
2009 Feb 26
1
layout of igraph
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
2010 Sep 27
1
Modify the vertex label
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]]
2011 Apr 11
1
plot - kamada.kawai layout without arrows
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
2011 Sep 29
1
plot.igraph
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.
2011 Sep 14
1
Questons about 'igraph' package
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 <-
2009 Apr 18
0
igraph 0.5.2
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
2009 Apr 18
0
igraph 0.5.2
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
2010 Jun 11
2
Clustering algorithms don't find obvious clusters
I have a directed graph which is represented as a matrix on the form
0 4 0 1
6 0 0 0
0 1 0 5
0 0 4 0
Each row correspond to an author (A, B, C, D) and the values says how many
times this author have cited the other authors. Hence the first row says
that author A have cited author B four times and author D one time. Thus the
matrix represents two groups of authors: (A,B) and (C,D) who cites
2009 Oct 12
0
function: ploting an igraph object within lattice
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,
2008 Feb 20
0
igraph package, version 0.5
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
2008 Feb 20
0
igraph package, version 0.5
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
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
2008 Nov 07
5
Agent-based social simulation and R
Do anyone know anything about the use of R for agent-based social
simulation? It should be possible, and would be convenient for the
simple reason that there are several nice packages containing useful
stuff for SNA (Social Network Analysis). Information about packages,
web sites, experienced persons in the field, etc. would be very welcome.
Tom
2009 Sep 11
2
Graph visualization
Hello,
I am working with graph and adjacency matrix, the package 'graph' seems to be appropriate for this.
An example in the package
> mat <- rbind(c(0, 0, 1, 1),
+ c(0, 0, 1, 1),
+ c(1, 1, 0, 1),
+ c(1, 1, 1, 0))
> rownames(mat) <- colnames(mat) <- letters[1:4]
> graph1 <- new("graphAM", adjMat=mat)
> graph1
A
2007 Nov 30
2
Hello I'm new and I've got a problem using metaflac
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 --set-tag-from-file="CUESHEET=sola.cue"
so
la.flac
sola.flac: ERROR: file 'sola.cue' for 'CUESHEET' tag value has embedded NULs
And I've got that error.
See I have the flac that is
2007 Feb 13
4
Advice on visual graph packages
Hey, all. I'm looking for packages that are good at two things
1) Drawing directed graphs (i.e nodes and edges), both with single
and double headed arrows, as well as allowing for differences in line
width and solid versus dashed. Note: I've tried Rgraphviz here, but
have run into some problems (which seem fixable and I may go with it
in the end), and it doesn't satisfy need
2007 Oct 08
2
graph or svn
Hello all,
I'm having a spot of trouble. I have made a very nice distance
matrix from some comparison calculations. However, the matrix is 3096 x
3096, so it's relatively large. Currently I'm using the svn package as
it seems to work for my data. The graph package errors and says the
"adjacency matrix must be symmetric for undirected graphs". I though
3096 x 3096 was
2008 Oct 24
18
Transferring results from R to MS Word
R-users
At the moment I am teaching a course on the use of R for data analysis.
Part of course requirements involves the transfer of results from R to
something that resembles the APA (American Psychological Associations)
type tables to MS Word. Until now I have used the HTML function in the
R2HTML library, with a call like this:
HTML(summary(model1), file("clipboard",
2006 Feb 09
11
Tranferring R results to word prosessors
I have just started looking at R, and are getting more and more irritated
at myself for not having done that before.
However, one of the things I have not found in the documentation is some
way of preparing output from R for convenient formatting into something
like MS Word. An example: If you use summary(lm(....)) you get nice
output. However, if you try to paste that output into the word
2012 May 02
0
Plotting network without overlapping vertices
Hello,
I am using the plot.igraph function in the igraph package to plot a network.
How do I keep vertices from overlapping? One option would be to pass an
argument that restricts vertices to occupy the same coordinates given their
size. A second option would be to increase the area of the plot (and
multiply the distance between vertices with a constant) while keeping the
size of vertices the