Description Usage Arguments Value Note
Build an nearest-neighbor graph weighted by distance.
Convert an edge matrix to a dist
object.
1 2 3 4 5 |
data |
A matrix with a number of columns equal to the number of columns in 'x' |
neighbors |
An adjacency matrix of the type produced by |
distance_method |
One of "Euclidean" or "Cosine" |
threads |
The number of threads to use in calculating distance; set automatically if |
verbose |
Verbosity |
... |
Additional parameters passed to |
m |
An 'edgematrix' object. |
diag |
logical value indicating whether the diagonal of the distance matrix should be printed by print.dist. |
upper |
logical value indicating whether the upper triangle of the distance matrix should be printed by print.dist. |
An 'edgematrix' object consisting of the elements of a sparse matrix, with the distance method stored in attribute method
.
A dist
object.
This method converts the otherwise sparse edge matrix into a dense dist
object,
where any distances absent from the edge matrix are represented as NA
.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.