Djikstra's algorithm
shortestPath(i, j, g, x = NULL, dbg = FALSE)
i
index from
j
index to
g
sg object
x
optional point pattern from which g was computed
dbg
verbose