search for: undirect

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 (when it started, who in...

Hello All, I went through lot of searching for papers to do clustering on Co-Authroship.I ran SNA metrics on my Undirected Graph(betweenness,Closeness,Eigen Vector) using R. After running the sna Metrics I found important nodes and did clustering on those nodes based on Binding strength .This clustering is done through if they are connected.I would like to do clustering based on Weight of the link. Example lets s...

...ero hay algo que no comprendo, al realizar clusters(datos), los $membership son todos 1, is.connected es T, transitivity(datos) es algo de 0.27, fastgreedy.community(datos) dice algo como Error in call igraph community fastgreedy, graph as logical merges, fast_community.c:538: detection works for undirected graph only. ¿Debo colocar una dirección para como se relacionan los datos?, no comprendo porque no obtengo clusters, o mejor dicho, con todos 1, lógicamente hay varias patología como infecciones que pertenecen al grupo infecciones, (en los nodos y vértices esto aparece ?contado? en forma correct...

Hi, I''m trying to use dtrace to signal threads in my app when certain events happen, and the raise() action seemed adequate -- looking at the kernel sources, it sends a signal to the currently executing thread, and a quick microbenchmark confirmed this. However, further testing showed that if lots of threads hit the event simultaneously, the signal only gets delivered once, and may also

...this is actually the cause of the slowdown yet. > > Regarding the paravirt lock, I have taken a further look into the > current PPC spinlock code. There is an equivalent of pv_wait() but no > pv_kick(). Maybe PPC doesn't really need that. So powerpc has two types of wait, either undirected "all processors" or directed to a specific processor which has been preempted by the hypervisor. The simple spinlock code does a directed wait, because it knows the CPU which is holding the lock. In this case, there is a sequence that is used to ensure we don't wait if the cond...

...this is actually the cause of the slowdown yet. > > Regarding the paravirt lock, I have taken a further look into the > current PPC spinlock code. There is an equivalent of pv_wait() but no > pv_kick(). Maybe PPC doesn't really need that. So powerpc has two types of wait, either undirected "all processors" or directed to a specific processor which has been preempted by the hypervisor. The simple spinlock code does a directed wait, because it knows the CPU which is holding the lock. In this case, there is a sequence that is used to ensure we don't wait if the cond...

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 mistake I am makin...

...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 graphAM graph with undirected edges Number of Nodes = 4 Number of Edges = 5 how can I plot the object graph1? Thanks in advance Arber [[alternative HTML version deleted]]

...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 <http://disciple.ouroborus.net/>, I ended up using an undirected graph to represent aliasing instead, I believe it might be suitable for TBAA's purposes as well, for the following reasons. * Does the graph need to be acyclic? Consider these struct types: struct a { type1 x; type2 y } struct b { type2 y; type3 z } struct c { type3 z; type1 x...

.... 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 symmetric?? However, the with the svn package the gplot command has been running for 6hr's now and no end in sight :) . Is there another package that i can use or a way to speed up the analysis, or even another way of displaying the data than the nodes...

...le everywhere. Is this > covered by your current (or planned) work? > I think chandler more than me. If me, assume I was wrong :P I believe you can prove it is not possible to do this without doing all the work of the separate passes. The main cost is the DFS walk, and you can't do an undirected DFS that will work here. I believe related things have even been proven to show the brokenness of various algorithms. See https://hal.inria.fr/hal-00761505 section 4.1 Given the difficulties and subtleties here, I would consider any such approach that tried to share work between the passes as &...

...+ groups: $`1` [1] "Ficha 1127" "Ficha 1309" "Ficha 1530" "Ficha 603" "mes 2" Los datos están de esta forma: (udatos son los mismos pero - udatos <-as.undirected(datos.network)) > head(get.data.frame(dIgraph.network)) from to Descripcion A Descripcion B Relacion 1 Ficha 1022 mes 10 Ficha Mes Ficha Mes 2 Ficha 1024 mes 8 Ficha Mes Ficha Mes 3 Ficha 1028 mes 2 Ficha Me...

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

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

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] ,&qu...

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

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&qu...

...the original data set, and use UCINET to convert it to .net file. It's too complicated. :( In the package of "igraph", edgelist is one the format which can be imported, however, weight can not be expressed. As for the format "ncol", weight is considered, but it's always undirected. Thank you for comments and suggestions! Best! Weijia [[alternative HTML version deleted]]

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', 'B', 'C') nodesTo =c('D', 'E', 'F') nodesAll = union(nodesFr, nodesTo) nElemFr = length(n...

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