Nothing
Contains a set of algorithms for creating partitions and coverings of objects largely based on operations on (dis)similarity relations (or matrices). There are several iterative reassignment algorithms optimizing different goodnessofclustering criteria. In addition, there are covering algorithms 'clique' which derives maximal cliques, and 'maxpact' which creates a covering of maximally compact sets. Graphical analyses and conversion routines are also included.
Package details 


Author  David W. Roberts <droberts@montana.edu> 
Maintainer  David W. Roberts <droberts@montana.edu> 
License  GPL (>= 2) 
Version  3.03 
URL  http://ecology.msu.montana.edu/labdsv/R 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.