Takes origins and destinations, finds the optimal routes between them and returns the result as a spatial (sf or sp) object. The definition of optimal depends on the routing function used
route( from = NULL, to = NULL, l = NULL, route_fun = cyclestreets::journey, n_print = 10, list_output = FALSE, cl = NULL, ... )
An object representing origins
(if lines are provided as the first argument, from is assigned to
An object representing destinations
Only needed if from and to are empty, in which case this should be a spatial object representing desire lines
A routing function to be used for converting the straight lines to routes
A number specifying how frequently progress updates should be shown
If FALSE (default) assumes spatial (linestring) object output. Set to TRUE to save output as a list.
Arguments passed to the routing function, e.g.
#>#>r_osrm <- route( from = c(-0.11, 51.514), to = c(-0.10, 51.506), route_fun = osrmRoute, returnclass = "sf" )#>r <- overline(routes_fast_sf[2:5, ], "length") l <- od2line(od_data_sample[2:5, 1:3], cents_sf) sln <- stplanr::SpatialLinesNetwork(r) # calculate shortest paths plot(sln)plot(l$geometry, add = TRUE)r_local <- stplanr::route( l = l, route_fun = stplanr::route_local, sln = sln )#>