+1 -1

DESCRIPTION

··· 1 1 Package: dodgr 2 2 Title: Distances on Directed Graphs 3 3 - Version: 0.4.0.014 3 3 + Version: 0.4.0.015 4 4 Authors@R: c( 5 5 person("Mark", "Padgham", , "mark.padgham@email.com", role = c("aut", "cre")), 6 6 person("Andreas", "Petutschnig", role = "aut"),

-4

R/compare-heaps.R

··· 13 13 #' @param replications Number of replications to be used in comparison 14 14 #' @return Result of `bench::mark` comparison. 15 15 #' 16 16 - #' @note \pkg{igraph} caches intermediate results of graph processing, so 17 17 - #' the \pkg{igraph} comparisons will be faster on subsequent runs. To obtain 18 18 - #' fair comparisons, run only once or re-start the current R session. 19 19 - #' 20 16 #' @family misc 21 17 #' @export 22 18 #' @examples

+1 -1

codemeta.json

··· 11 11 "codeRepository": "https://github.com/UrbanAnalyst/dodgr", 12 12 "issueTracker": "https://github.com/UrbanAnalyst/dodgr/issues", 13 13 "license": "https://spdx.org/licenses/GPL-3.0", 14 14 - "version": "0.4.0.014", 14 14 + "version": "0.4.0.015", 15 15 "programmingLanguage": { 16 16 "@type": "ComputerLanguage", 17 17 "name": "R",

-5

man/compare_heaps.Rd

··· 25 25 Alternatively, this random sub-graph can be pre-generated with the 26 26 \code{dodgr_sample} function and passed directly. 27 27 } 28 28 - \note{ 29 29 - \pkg{igraph} caches intermediate results of graph processing, so 30 30 - the \pkg{igraph} comparisons will be faster on subsequent runs. To obtain 31 31 - fair comparisons, run only once or re-start the current R session. 32 32 - } 33 28 \examples{ 34 29 graph <- weight_streetnet (hampi) 35 30 \dontrun{