[Vegan-commits] r540 - pkg/man
noreply at r-forge.r-project.org
noreply at r-forge.r-project.org
Thu Oct 30 14:17:15 CET 2008
Author: jarioksa
Date: 2008-10-30 14:17:15 +0100 (Thu, 30 Oct 2008)
New Revision: 540
Modified:
pkg/man/spantree.Rd
Log:
spantree: Rd files knows about rev539
Modified: pkg/man/spantree.Rd
===================================================================
--- pkg/man/spantree.Rd 2008-10-30 11:49:58 UTC (rev 539)
+++ pkg/man/spantree.Rd 2008-10-30 13:17:15 UTC (rev 540)
@@ -35,9 +35,9 @@
by \code{\link{scores}}.}
\item{cex}{Character expansion factor.}
\item{type}{Observations are plotted as points with
- \code{type="p"} or \code{type="b"}, or as text with
+ \code{type="p"} or \code{type="b"}, or as text label with
\code{type="t"}. The tree (lines) will always be plotted.}
- \item{labels}{Text used with \code{type="t"} or row names if this is
+ \item{labels}{Text used with \code{type="t"} or node names if this is
missing.}
\item{dlim}{A ceiling value used to highest \code{cophenetic} dissimilarity.}
\item{FUN}{Ordination function to find the configuration from
@@ -68,8 +68,7 @@
to set \code{dlim}, and sometimes the results will remain
twisted). These ordination methods do not work with disconnected
trees, but you must supply the ordination configuration. Function
- \code{lines} will overlay the tree in an existing
- plot.
+ \code{lines} will overlay the tree in an existing plot.
Function \code{spantree} uses Prim's method
implemented as priority-first search for dense graphs (Sedgewick
@@ -89,6 +88,7 @@
and tree is disconnected at the node.}
\item{dist }{Corresponding distance. If \code{kid = NA}, then
\code{dist = 0}.}
+ \item{labels }{Names of nodes as found from the input dissimilarities.}
}
\references{
Sedgewick, R. (1990). \emph{Algorithms in C}. Addison Wesley.
More information about the Vegan-commits
mailing list