View source: R/Seurat_monocle_workflow.R
iscycle | R Documentation |
Get shortest paths from edge matrix.
iscycle(G, S, D)
G |
Edge matrix. |
S |
Numeric. The Start node number in G. |
D |
Numeric. The End node number in G. |
A list contain dist and path between Start node number and End node number.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.