shortestPath: shortest path on the graph

Description

Djikstra's algorithm

Usage

1
shortestPath(i, j, g, x = NULL, dbg = FALSE)

Arguments

i

index from

j

index to

g

sg object

x

optional point pattern from which g was computed

dbg

verbose


Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.