Package 'fpc' - open source solution for an Internet free, intelligent ...
Package 'fpc' - open source solution for an Internet free, intelligent ...
Package 'fpc' - open source solution for an Internet free, intelligent ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
34 con.comp<br />
con.comp<br />
Connectivity components of <strong>an</strong> undirected graph<br />
Description<br />
Computes the connectivity components of <strong>an</strong> undirected graph from a matrix giving the edges.<br />
Usage<br />
con.comp(comat)<br />
Arguments<br />
comat<br />
a symmetric logical or 0-1 matrix, where comat[i,j]=TRUE me<strong>an</strong>s that there is<br />
<strong>an</strong> edge between vertices i <strong>an</strong>d j. The diagonal is ignored.<br />
Details<br />
Value<br />
The "depth-first search" algorithm of Cormen, Leiserson <strong>an</strong>d Rivest (1990, p. 477) is used.<br />
An integer vector, giving the number of the connectivity component <strong>for</strong> each vertice.<br />
Author(s)<br />
Christi<strong>an</strong> Hennig http://www.homepages.ucl.ac.uk/~ucakche/<br />
References<br />
Cormen, T. H., Leiserson, C. E. <strong>an</strong>d Rivest, R. L. (1990), Introduction to Algorithms, Cambridge:<br />
MIT Press.<br />
See Also<br />
hclust, cutree <strong>for</strong> cutted single linkage trees (often equivalent).<br />
Examples<br />
set.seed(1000)<br />
x
Change language