lcomponent {prabclus}R Documentation

Largest connectivity component

Description

Computes the size of the largest connectivity component of the graph of ncol(distmat) vertices with edges defined by the smallest ne distances.

Usage

lcomponent(distmat, ne = floor(3*ncol(distmat)/4))

Arguments

distmat symmetric distance matrix.
ne integer.

Value

list with components

lc size of the largest connectivity component.
ne see above.

Author(s)

Christian Hennig hennig@math.uni-hamburg.de http://www.math.uni-hamburg.de/home/hennig/

References

Hennig, C. and Hausdorf, B. (2002) Distance-based parametric bootstrap tests for clustering of species ranges, submitted, http://stat.ethz.ch/Research-Reports/110.html.

See Also

prabtest

Examples

data(kykladspecreg)
# Note: If you do not use the installed package, replace this by
# kykladspecreg <- read.table("(path/)kykladspecreg.dat")
j <- jaccard(t(kykladspecreg))
lcomponent(j)

[Package prabclus version 1.0-2 Index]