[R] clustering: single linkage path in minimum spanning tree

[George Ostrouchov]

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 package that I should be using?

Thanks for your help!

George



-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
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 subject !)  To: r-help-request at stat.math.ethz.ch
_._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._._