Learn R Programming

prabclus (version 1.0-2)

lcomponent: 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
  • lcsize of the largest connectivity component.
  • nesee above.

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

Run this code
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)

Run the code above in your browser using DataLab