search for: shortest

Dear R Users, I have a network of 25000 total nodes and a list of 500 node which is a subset of all nodes. Now I want to calculate the APSP (all pair shortest path) matrix only for these 500 nodes. I would appreciate any help. Thanks in advance Dinesh -- Dinesh Kumar Barupal Research Associate Metabolomics Fiehn Lab UCD Genome Center 451 East Health Science Drive GBSF Builidng University of California DAVIS 95616 http://fiehnlab.ucdavis.edu/staff/kuma...

Um texto embutido e sem conjunto de caracteres especificado associado... Nome: n?o dispon?vel Url: https://stat.ethz.ch/pipermail/r-help/attachments/20080208/bf7b4696/attachment.pl

...is the track I'm on using list.files to capture the names of the files and then lapply with read.table. But I run into problems making a usable dataframe out of the data. #Creating example data in similar format to data I have sub <- rep(1,10) trial <- seq(1,10,1) size <- rep(3,10) shortest <- rep(444,10) startlab <- rep(444,10) endlab <- rep(444,10) startconf <- rep(444,10) endconf <- rep(444,10) steps <- sample(1:30,10) time <- sample(1:300,10) #creating example of text file and saving into a shared director with other txt files subject1 <- cbind(sub1,trial...

I have a table with some data structured something like this: book ---- title (varchar) pages (int) completed_on (date) While I can find the shortest book completed in each year with something like this: select min( pages ), year from book group by year I would also like to get the title of the shortest book in each year. Is there any way to do this by modifying the previous query to pull that as well in a single pass? The only approach...

...f course. Thanks for any help! Jonne. # Read a table dir = "..." file = "..." # huge file, 12 Mb stats = read.table(paste(dir, file, sep=""), header=TRUE) # Select several columns data = subset(stats, select = c(sum.delivery.penalty, avg.EDGE.IN.SHORTEST.PATH.COUNT, avg.EDGE.IN.SHORTEST.PATH.COUNT, avg.DEGREE)) require(mva) pc2 = prcomp(data, retx = TRUE, center = TRUE, scale. = TRUE, tol = NULL) pc2 summary(pc2) --- gives the following output > pc2 Standard deviations: [1] 1.424074e+00 1.000000e-00 9.859080...

Using Igraph, I create shortest paths, then convert the matrix into three column vectors - "vertex1", "vertex2", "shortestpath" - as the code below shows. #code for generating shortest path matrix and creating a 3 columns from an igraph graph object "y" y_s<-shortest.paths(y, weights =...

hello, I have a graph and i use qgraph package to calculate centrality parameters. Now I want to know the maximum value of shortest path for each vertex with discarding the Inf value in short pathes. For this I use the ShortestPathLengths of centrality function in qgraph. but when I want to get the maximum the result is wrong. here is my code: cen<-centrality(Q) tmp3<-cen$ShortestPathLengths shp<-matrix(1:ncol(tmp3),...

This time, it seems that browser() wins. Grr ... -k =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- r-devel mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-devel-request@stat.math.ethz.ch

Hi, David. Spill intervals must be precolored because they can't be spilled once more. They are the shortest intervals precisely over each def/use of the original interval. That is why they also have their weights set to #INF. Imagine that on a second iteration allocation algorithm figures out that some spilled interval can't be assigned a physical register. Allocator can't spill it so some recol...

Why? Because we have a mixture scattered about the codebase, but only a very few with `.TXT`. I like consistency. It makes my obsessive tendancies happy. Is this important? Nope. Why am I asking first? Because its possible someone, somewhere will be disrupted by this so I figured I'd ask first. -Chandler -------------- next part -------------- An HTML attachment was scrubbed... URL:

In the following deployment of web app on ONE pc-based server,running linux,which can support the most amount of concurrent users as well as the shortest latency? 1 apache+mongrel 2 apache+mongrel_cluster 3 lighthttpd+mongrel 4 lighthttpd+mongrel_cluster 5 lighthttpd+fastcgi Thanks charlie -- Posted via http://www.ruby-forum.com/.

...tion.community for details. - The DrL layout generator now supports 3d layouts. - A limited Tcl/Tk igraph GUI was added, please note that it supports only a small fraction of the igraph functions. You can start it with the tkigraph() function. - Johnson's algorithm is now supported by the shortest path finder. It allows negative edge weight, but not negative cycles. See ?shortest.paths. - The graph.knn function was added to calculate the average nearest neighbor degree. It supports edge weights as well. - Curved edges are now supported by plot() and tkplot(), see ?igraph.plotting for...

...tion.community for details. - The DrL layout generator now supports 3d layouts. - A limited Tcl/Tk igraph GUI was added, please note that it supports only a small fraction of the igraph functions. You can start it with the tkigraph() function. - Johnson's algorithm is now supported by the shortest path finder. It allows negative edge weight, but not negative cycles. See ?shortest.paths. - The graph.knn function was added to calculate the average nearest neighbor degree. It supports edge weights as well. - Curved edges are now supported by plot() and tkplot(), see ?igraph.plotting for...

On Monday 06 August 2007 12:15, Anton Vayvod wrote: > Spill intervals must be precolored because they can't be spilled once more. > They are the shortest intervals precisely over each def/use of the original > interval. That is why they also have their weights set to #INF. Yes, that's true. But I wonder if we shouldn't be smarter about which register we pick to color it. In Bill W's implementation, it was essentially random. What...

Hi R-ers: I need to compute the distance between 2 street addresses in either km or miles. I do not care if the distance is a "shortest driving route" or if it is "as the crow flies." Does anybody know how to do this? Can it be done in R? I have thousands of addresses, so I think that Mapquest is out of the question! Please rely to: philipsmith at alumni.albany.edu Thank you! Phil Smith

Hi, I have a question about computing shortest Euclidean distances between two data frames of spatial points... I have 2 dataframes (not yet converted to spatial class) >Sewers<-data.frame(x=c(10,20,35,50),y=c(100,150,200,300)) >transect <- data.frame(x=seq(from=0, to=50, by=1),y=seq(from=100, to=150, by=1)) I would like to b...

...rex/index.html -- Sent from my phone. Please excuse my brevity. On June 20, 2017 11:15:23 AM PDT, Zahra Tofighi <tofighizahra at gmail.com> wrote: >hello, > >I have a graph and i use qgraph package to calculate centrality >parameters. >Now I want to know the maximum value of shortest path for each vertex >with >discarding the Inf value in short pathes. For this I use the >ShortestPathLengths of centrality function in qgraph. but when I want >to >get the maximum the result is wrong. here is my code: > >cen<-centrality(Q) > >tmp3<-cen$ShortestPath...

This is not really a problem just something I noticed in my testing.. When two or more Asterisk servers are connected by IAX2 trunks it does not make use of any "shortest path" type system.. (maybe this is still planned somwhere down the line, but may come in handy to those who have multi asterisk installations) Here is the setup.. UA1--- Asterisk1----[IAX2 Trunk]---Asterisk2---UA2 | UA3 If I have a call between UA1 and U...

On Thu, Jan 17, 2019 at 6:51 PM Hubert Tong < hubert.reinterpretcast at gmail.com> wrote: > I'm wondering if this would wreak havoc upon semi-case-sensitive systems > like Windows. I'd like to hear from people who use Git and SVN on Windows. > FWIW, I will of course not do this in any case where there might be a collision due to such file systems. I don't think there

Hello fellow CentOS-users, on the net there are lots of Spamassassin related HOWTOs - describing how to create a shell script for Postfix and how to install Spamassassin and start its spamd daemon - step by step. Additionally antivirus setups are described... But I have a strong feeling, that this is unneeded on CentOS 6 - because there are already preconfigured stock packages for postfix and