shortestPath | R Documentation |
Djikstra's algorithm
shortestPath(i, j, g, x = NULL, dbg = FALSE, checksym = TRUE)
i |
index from |
j |
index to |
g |
sg object |
x |
optional point pattern from which g was computed |
dbg |
verbose |
checksym |
check (and force) symmetry |
If x is given, we use the point-to-point distances as edge weights. Otherwise, each edge has weight 1.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.