Description Usage Arguments Value Examples
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.
1 | conn_knn_graph(embedding, k)
|
embedding |
Low-dimensional LLE embedding of cells |
k |
Number of nearest neighbors |
An igraph object corresponding to the k-NN graph
1 2 3 4 5 | genes=1:200
cells=sample(1:500,30)
k=10
traj_lle = lle::lle(traj[cells,genes],m=2,k)$Y
traj_graph = conn_knn_graph(traj_lle,5)
|
finding neighbours
calculating weights
computing coordinates
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.