Description Usage Arguments Value
Run a KNN graph and store as an igraph object. The nearest neighbors are calculated using the dbscan implementation. The edges of the graph can be weighted with the inverse of the euclidean distance.
1 |
x |
An SCE object. |
nn |
Number of nearest neighbors to use. |
weighted |
Logical indicating whether to weigh the knn graph. |
verbose |
verbosity |
An SCE object
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.