Constructs a deep copy of self.

Constructs the specified number of clusters from the hierarchical linkage tree.

Guarantees that there is only one reference to the underlying data and that this data is in contiguous storage.

Tests for equality of this connectivity matrix and another connectivity matrix. Two connectivity matrices are equal if they have the same dimensions and all values are equal.

Computes hash code.

Gets the Type of the current instance.

Returns the k by k upper left corner of the matrix. The matrix and the submatrix share the same data.

Changes the order of this matrix to that specified, adding zeros or truncating as necessary.

Creates a shallow copy of this matrix.

Returns this matrix.

Gets the number of columns in the matrix.

Gets the vector of cophenetic distances between all possible element pairs resulting from the hierarchical cluster analysis.

Gets the data vector referenced by this matrix.

Gets and the distance function used in the hierarchical cluster analysis.

Gets the vector of distances between all possible object pairs, computed using the current distance delegate.

Gets and sets the value at the specified position. Symmetry is maintained.

Gets and sets the labels for the rows/columns of the connectivity matrix.

Gets the complete hierarchical linkage tree, computed from Distances using the current linkage delegate.

Gets the number of row/column labels.

Gets the order of the matrix.

Gets the permutation vector of the node labels of the leaves of the dendrogram corresponding the hierarchical cluster analysis. Labels are zero based. The permutation vector, p, is used to reorder the connectivity matrix as follows: if A is the original connectivity matrix and C is the ordered connectivity matrix then C[i,j] = A[p[i],p[j]].

Gets the number of rows in the matrix.