mark padgham
mark padgham
Current checks both on GitHub and CRAN windows machines fail when the cache is switched off. They have been skipped with this line: https://github.com/ATFutures/dodgr/blob/08c5760c1d9df6c0f0f90b8708061552b991180b/tests/testthat/test-cache.R#L65 Need to find out what is...
After #69 ad #89, `dodgr` will be able to calculate centrality more efficiently than `igraph`, and it will be straightforward to adapt existing code to do so.
It's high time that was broken into at least: - distances and times - flow aggregation - isodistances and isochrones
running to keep up with [`stplanr` ...](https://github.com/ropensci/stplanr/issues/334)
Extending from discussions with @Robinlovelace & @fiftysevendegreesofrad [here](https://github.com/ITSLeeds/snet/issues/4) (private repo), in relation to the ["Urban Network Analysis" software](http://cityform.mit.edu/projects/urban-network-analysis.html), which offers a metric of network redundancy. ### Urban Network Analysis "Redundancy...
Coz i'm pretty sure nobody uses them anyway, and the differences are very generally extremely minor. It was interesting to start with, but reducing to binary heap will simplify the...
Current work on [New York city pedestrian flows](https://github.com/ATFutures/who3/tree/master/calibration), via [`moveability/calibration` repo](https://github.com/moveability/calibration) uses Spatial Interaction models input to [`dodgr_flows_aggregate()`](https://atfutures.github.io/dodgr/reference/dodgr_flows_aggregate.html) via the entirely arbitrary `flows` argument, which is a > Matrix of...
The current code does not return a minimal cycle basis at all. Maybe implement the same algorithm as [`networkx`](https://networkx.github.io/documentation/networkx-2.1/reference/algorithms/generated/networkx.algorithms.cycles.minimum_cycle_basis.html) (with code [here](https://networkx.github.io/documentation/networkx-1.10/_modules/networkx/algorithms/cycles.html)), which is described in [this paper](https://link.springer.com/article/10.1007/s00453-007-9064-z) (direct pdf...
Currently uses [Naismith's Rule](https://github.com/ATFutures/dodgr/blob/master/R/weight-streetnet-times.R#L261), but i found out from [this tweet](https://twitter.com/MichaelDorman84/status/1213762059810279424) by @michaeldorman about the [`movecost` package](https://cran.r-project.org/web/packages/movecost/index.html) which implements several alternative cost functions. Some of these could also be implemented.
@Robinlovelace's outstanding little treatise in [this `stplanr` issue](https://github.com/ropensci/stplanr/issues/273) should be worked through step-by-step in `dodgr` terms, to ensure we're both aiming for the same things. This is likely also related...