Description Usage Arguments Details Value See Also
View source: R/findShortestPathways.R
This functions finds shortest pathways between selected nodes in a distance matrix.
1 | findShortestPathways(BetweenNodesDistances, SelectedNodes)
|
BetweenNodesDistances |
A distance matric computed by convertToDistGraph() |
SelectedNodes |
The selected nodes to keep after shortest paths conversion |
The Dijkstra's algorithm from the igraph package is used to compute shortest paths.
A list with distances, intermediates and number of intermediates given by the igraph package
getShortestPaths, convertToDistGraph
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.