mark padgham

Re-opening because this now seems really worth doing. I just have to code a custom Dijkstra to (i) use (rounded) `` edge weights; and (ii) aggregate to unit-integer values. Can...

Note [this algorithm](https://kops.uni-konstanz.de/bitstream/handle/123456789/5739/algorithm.pdf) (original paper [here](https://www.tandfonline.com/doi/abs/10.1080/0022250x.2001.9990249) - "A faster algorithm for betweenness centrality" (2001)). This is what [`igraph` uses](https://igraph.org/r/doc/betweenness.html), and fairly straightfoward to implement.

All of the C++ work done in [this commit](https://github.com/ATFutures/dodgr/commit/acb67d3b7a479ad8d083ebcfdd833603ae7f810a). Now just have to wrap in an R function, and test.

@Robinlovelace That gets us to this: ``` r library(dodgr) graph

It already does that, and the idea is to enable flexible specification of different ways of measuring centrality that can't be done via `igraph`, notably including for example centrality considering...

``` r setwd ("/data/mega/code/repos/atfutures/dodgr") devtools::load_all (".", export_all = FALSE) #> Loading dodgr graph % weight_streetnet (wt_profile = "bicycle") %>% dodgr_contract_graph () #> The following highway types are present in data...

Re-opened to implement threshold parameter - centrality measured only within a certain distance of each point converges to value measured over entire graph (within some constant scale factor), so this...

That commit and the few ones prior implement a couple of helper functions, `estimate_centrality_threshold()` and `estimate_centrality_time()`. These are very useful for big graphs, for which true centrality measures using every...

Related to this: It would also be useful to have the spell check hook respect the "Language" field in the DESCRIPTION file, where that is given. I've not look at...

That doesn't currently do anything with NEWS files, but i could easily grab them all for you in a few minutes if you wanted? Let me know