Nothing
context ("dodgr_paths")
test_that ("paths", {
graph <- weight_streetnet (hampi)
from <- graph$from_id [1:100]
to <- graph$to_id [100:150]
to <- to [!to %in% from]
expect_message (
dp <- dodgr_paths (graph,
from = from,
to = to,
quiet = FALSE
),
"Calculating shortest paths ..."
)
expect_is (dp, "list")
expect_equal (length (dp), 100)
expect_equal (unique (sapply (dp, length)), length (to))
expect_is (dp [[1]] [[1]], "character")
lens <- unlist (lapply (dp, function (i) lapply (i, length)))
dp <- dodgr_paths (graph, from = from, to = to, vertices = FALSE)
expect_is (dp, "list")
expect_equal (length (dp), 100)
expect_equal (unique (sapply (dp, length)), length (to))
lens2 <- unlist (lapply (dp, function (i) lapply (i, length)))
# edge lists should all have one less item than vertex lists
lens2 <- lens2 [which (lens > 0)]
lens <- lens [which (lens > 0)]
expect_true (all (abs (lens - lens2) == 1))
})
test_that ("pairwise paths", {
graph <- weight_streetnet (hampi)
from <- graph$from_id [1:10]
to <- graph$to_id [100:105]
indx <- which (!to %in% from)
to <- to [indx]
from <- from [indx]
n <- length (indx)
dp <- dodgr_paths (graph, from = from, to = to, pairwise = TRUE)
expect_is (dp, "list")
expect_equal (length (dp), n)
expect_true (all (lapply (dp, length) == 1))
expect_error (
dp <- dodgr_paths (graph,
from = from, to = to [-1],
pairwise = TRUE
),
"pairwise paths require from and to to have same length"
)
})
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.