This function constructs a k-nearest neighbor graph using an LLE embedding, then adds the minimum number of edges needed to make the graph fully connected.
Low-dimensional LLE embedding of cells
Number of nearest neighbors
An igraph object corresponding to the k-NN graph
1 2 3 4 5
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.