similar to: Where is a function for minimum spanning tree in R for win

Hello. Is NN for R for Win available? It seemes that there's no NN package in contributed ones. -------------- next part -------------- An HTML attachment was scrubbed... URL: https://stat.ethz.ch/pipermail/r-help/attachments/20010310/6a58939c/attachment.html

Hi. Does anyone know whether CA(Cellular Automata), GA(Genetic Algorithm) or Multi-Agent System is available for R for Win? I've already knowna software for these areas, SWARM or startlogo. But I'd like to link R's function with these methods. -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hello. I've dowloaded R-0.65.1 for WinNT/9X. >There is more support for (support of) ActiveX Automation via the >Rproxy.dll: see the file front-ends/readme. And where is this "the file front-ends/readme" which describes R's ActiveX Automation ? In "readme" under "r-install path\" and FAQ for Win port, no description about this. Please teach me.

Hello. I've dowloaded R-0.65.1 for WinNT/9X. >There is more support for (support of) ActiveX Automation via the >Rproxy.dll: see the file front-ends/readme. And where is this "the file front-ends/readme" which describes R's ActiveX Automation ? In "readme" under "r-install path\" and FAQ for Win port, no description about this. Please teach me.

hello, i have some problems with mstree! there are no similar function in R like in S-Plus! Is there somebody who has a code in R ???? Thanks

Hi, I need to find all minimum spanning trees of an unweighted graph. Is there a way in R to do that? Thanks -- View this message in context: http://n4.nabble.com/Minimum-Spanning-Trees-tp1569351p1569351.html Sent from the R help mailing list archive at Nabble.com.

My understanding is that single linkage clustering is equivalent to finding the minimum spanning tree. Hclust works very nicely for finding the clusters but I am unable to find enough information in its output to construct the minimum spanning tree. In particular, I want to find a minimum spanning tree path between two items in the tree. Is this possible with hclust or is there another

Here are the functions documented in the Blue Book that I found missing in R (ignoring the ones which are obviously outdated). aggregate allocated amatch axes chull clorder cutree cycle date debugger dget discr faces interp l1fit labclust lag loglin monthplot mstree mulbar napsack odometer persp plclust plotfit rep.int restore rreg sabl sablplot set.seed smooth sort.list Stable stars

Dear all, I have an ontology which I would like to load in R to then compute the minimum distance between elements. Since this ontology is not only DAG, the problem is non trivial and therefore decided to use R with the powerful e1071 library (allShortestPaths) to do that. That method requires to provide a distance matrix between the various objects. My ontology contains 32768 objects and

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

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 be able to compute the shortest distance from the

Thanks Mike. My data has longitude and latitude coords and I used distAB {clim.pact} then mst {ape} to calculate my minimum spanning tree. The nodes are telecoms sites from all over Australia. My goal is to determine the minimum cost of linking them via cabling, and I'm starting by calculating the distance "as the crow flies", but will probably eventually need to calculate the

Hello, the R people. I look for robust regression in R. This method is available in S, its name is rreg. Colud anyone teach me ? -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- r-help 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

Hello. For building REmbeddedPostgres in Omegat project(http://www.omegahat.org/RSPostgres/) requiring PostgresSQL's libs, I've tried to build R1.6.1 on Cygwin following the instruction of http://www.stats.ox.ac.uk/pub/Rtools/ since full-spec PostgresSQL running on Windows can run only on Cygwin environment, However I've got following error messages. make -C front-ends Rpwd

Hi. Three years ago, I've read the question of availability of SOM library for R using Kohonen's SOM_PAK in this mailing-list. This answer was no availability. And no package dealing with SOM in CRAN. Is this situation same? Could you tell me availability this library? Best Regards.

Hello. I try to create stat sever by IIS 4.0 + ASP + VBScript with R for Win on NT Sever 4.0 SP6a. However VBScript denied redirection input of R script. Do Rwin developers have a plan to add a following function by adding an argument of command line? rterm --script 'r script path & file name' -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi. I've tried to create a polygon with one hole by gpclib using following example script. holepoly <- read.polyfile(system.file("poly-ex/hole-poly.txt", package ="gpclib"), nohole = FALSE) area.poly(holepoly) plot(holepoly,poly.args=list(col="red",border="blue")) And I noticed plot function couldn't draw polygons with holes correctly.

´ËÖ ¾´Àñ ÕÅÁÁ Õã½­´óѧÊý×ÖËù -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.linux-foundation.org/pipermail/bridge/attachments/20060507/93a3f83b/attachment.htm

Monty, I recently noticed half a patch in my libogg tree, and thought I'd forward it for discussion. I did this some time ago when were were talking about the long pages issue. The basic idea is to allow pages to grow up to 100% above the flush threshold if this allows us to end at a packet boundary. This reduces the frequency of pages with spanning packets which should be some assistance to

Hi , Im new in this list, and Im trying to find a Spanning Tree source code, the kind that runs in bridges and switches. Does anybody know wher I can find it? Any help would be appreciated. Thanks, -- Francisco Trindade fmtrindade@inf.ufrgs.br