similar to: Undirected to Directed Graph ( Clustering Based on Link Strength)

Displaying 20 results from an estimated 300 matches similar to: "Undirected to Directed Graph ( Clustering Based on Link Strength)"

2009 Mar 25
1
Weighted Graph Link strength ( I am making mistake please help)
Hello R experts, I went through R mailing,Nabble R.I could not find solution.Can someone help me. I have undirected Graph. Here is an example of spreadsheet I have( Unique 3559 Nodes) snippet of 4 rows. Node1 Node2 Weights 1 2 5 2 3 30 2 4 30 1 4 5 3 4 30 1 3 2 I created a program reading the csv and created a Adjacency matrix.From the adjacency matrix I created graph.I am not sure the
2008 Nov 20
3
Any progress on undirected self-referential many to many relationships?
I am going to re-ask a question that has been asked a few times in the past. What is the best way to represent an undirected self-referential many to many relationship. Trivial examples of this include an edge in an undirected graph, or a mutual friendship. Alice is a person Bob is a person Alice and Bob are friends of each other We have a whole bunch of extra information about their friendship
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
2020 Jul 08
2
[PATCH v3 0/6] powerpc: queued spinlocks and rwlocks
Excerpts from Waiman Long's message of July 8, 2020 1:33 pm: > On 7/7/20 1:57 AM, Nicholas Piggin wrote: >> Yes, powerpc could certainly get more performance out of the slow >> paths, and then there are a few parameters to tune. >> >> We don't have a good alternate patching for function calls yet, but >> that would be something to do for native vs pv.
2020 Jul 08
2
[PATCH v3 0/6] powerpc: queued spinlocks and rwlocks
Excerpts from Waiman Long's message of July 8, 2020 1:33 pm: > On 7/7/20 1:57 AM, Nicholas Piggin wrote: >> Yes, powerpc could certainly get more performance out of the slow >> paths, and then there are a few parameters to tune. >> >> We don't have a good alternate patching for function calls yet, but >> that would be something to do for native vs pv.
2020 Jul 08
0
[PATCH v3 0/6] powerpc: queued spinlocks and rwlocks
On 7/8/20 1:10 AM, Nicholas Piggin wrote: > Excerpts from Waiman Long's message of July 8, 2020 1:33 pm: >> On 7/7/20 1:57 AM, Nicholas Piggin wrote: >>> Yes, powerpc could certainly get more performance out of the slow >>> paths, and then there are a few parameters to tune. >>> >>> We don't have a good alternate patching for function calls yet,
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
2013 Mar 05
3
[LLVMdev] tbaa metadata representation
Hi all, A while ago there was a discussion on changing the current "set of trees" representation of TBAA metadata to be more expressive, prompted by the need to support C structs. Dan Gohman also talked about the issue here: http://llvm.org/devmtg/2012-11/Gohman-AliasAnalysis.pdf. It was suggested that the trees be replaced by a type DAG then. While working on this compiler
2015 Dec 02
2
igraph o network
Estimados, estoy ?jugando? con unos datos clínicos donde realizo un análisis de redes, utilicé igraph como nerwork, pero finalmente uso igraph (creo que tiene más opciónes). Son algo de 200 nodos y algo más de 2000 relaciones. Puedo graficarlos. Los datos están de la siguiente forma, por ejemplo, individuo, patología, (las dos primeras columnas son la relación), luego un fármaco, el grupo
2006 Jul 06
1
Rgraphviz: Setting the edge width
I create an undirected graph with Rgraphviz (see code below). I would like to make the edges thicker. Can anyone help on this?? Regards S?ren V <- c("A","B","C","D") E <- list(c("A","B"),c("B","C"),c("C","D"),c("D","A"),c("A","C")) Eidx
2010 May 12
1
[LLVMdev] Graph Utilities
Hi, I am wondering if there is any generic graph data structure along with its traversal routines already available in LLVM-2.7. In particular, I am looking for creating both directed and undirected graphs and be able to perform dfs, topsort, and scc on them. Best regards, Raj
2006 Apr 27
1
random walk on graph
Hi all, I'm having issues coding a random walk on a fully connected, undirected graph G with probability transition matrix P = (p_ij). Here is what I have so far ... for(i in 1:n){ for(m in 1:M){ x <- as.vector(matrix(rep(0,N+1),nc=N+1)) x[1] <- i for(k in 2:N+1){ y <- as.vector(matrix(rep(0,n),nc=n)) r <- runif(1) c <- c(0,cumsum(P[x[k-1],])) for(j in
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
2009 Dec 04
1
R igraph clusters component
Hi R-users, I'm using igraph for an undirected graph. i used clusters() igraph function to know the component size(subgraphs) as shown bellow: c <-clusters(g)    # component sizes size <- sort(c$csize, decreasing=TRUE) cat("Top 20 cluster of the graph","\n") for (i in 1:20) {   cat(i,"  size:",size[i] ,"\n") } Can anyone help how to extract the
2011 Feb 13
1
RCytoscape setPosition error
Hi Can some one please point out where i am wrong. I am trying to position set of nodes column-wise in cytoscape using RCytoscape A----D B----E C----F ------------------- g <- new ('graphNEL', edgemode='undirected') cw <- CytoscapeWindow ('smallExample', graph=RCytoscape::makeSimpleGraph()) layout (cw, 'jgraph-spring') redraw(cw) nodesFr = c('A',
2011 Jul 06
1
superimposing network graphs
Dear all, I have a undirected network (g), representing all the sexual relationships that ever existed in a model community. I also have a directed edgelist (e) which is a subset of the edgelist of g. e represents the transmission pathway of HIV. Now I would like to superimpose the picture of the sexual relationships with arrows in a different colour, to indicate where in the network HIV was
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
2006 Jul 06
1
Rgraphviz: How to control the colours of edges in a graph
Using Rgraphviz, I draw the undirected graph with vertices A,B,C and D and edges A:B, B:C, C:D, D:A, A:C. I want the vertices A and B to be red and C and D to be blue. The problem is the following: I want the edges A:B and B:C to be green and the edges C:D and C:A to be yellow, while the edge A:C can have the default colour black. I assume that I have to specify this using the edgeAttrs-argument
2008 Mar 05
1
connectivity measure for graph nodes
I am doing some work the Rgraphviz, a Bioconductor package, but since my question is of a more general nature, thought I would send to this list in hopes that a graph theory expert could answer my question. I wish to do some statistics on node-node relationships. In particular, I want to see if two connected nodes share a common property. I believe that the more "connected" the two
2012 Dec 11
1
Dispatching on a dgCMatrix does not work.
I represent a graph as an adjacency matrix of class "dgCMatrix" (from the Matrix package). > xx 5 x 5 sparse Matrix of class "dgCMatrix" a b c d e a . 1 1 . . b 1 . 1 . . c 1 1 . 1 1 d . . 1 . 1 e . . 1 1 . To check if the matrix defines and undirected graph, I have made the following functions/methods: is.UG <- function (object) { UseMethod("is.UG") }