get_mst_with_shortcuts: function to find the minimum spanning tree, augmented with...
In cole-trapnell-lab/L1-graph: Finding Principal Graphs via L1 Optimization
Description
Usage
Arguments
Value
Description
function to find the minimum spanning tree,
augmented with shortcuts on vertices of odd degree
Usage
1
get_mst_with_shortcuts(X, K = 5)
Arguments
X
number of rows in the returned eye matrix (D * N)
K
of nearest neighbors for use with shortcutting
Value
a matrix
cole-trapnell-lab/L1-graph documentation built on May 17, 2019, 12:50 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
Description
function to find the minimum spanning tree, augmented with shortcuts on vertices of odd degree
Usage
1 | get_mst_with_shortcuts(X, K = 5)
|
Arguments
X |
number of rows in the returned eye matrix (D * N) |
K |
of nearest neighbors for use with shortcutting |
Value
a matrix
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.