dodgr

dodgr copied to clipboard

Fix caching on windows machines

2

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...

mpadge

sanitize_graph function

7

I tried a minimal network with 5 edges joined at two nodes:  ```R edges

mdsumner

network centrality function

14

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.

mpadge

It's high time that was broken into at least: - distances and times - flow aggregation - isodistances and isochrones

mpadge

running to keep up with [`stplanr` ...](https://github.com/ropensci/stplanr/issues/334)

mpadge

Angular betweenness

2

Is it possible to calculate angular betweenness of edges in a network?

Robinlovelace

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...

mpadge

get rid of different heaps; use only binary sort

1

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...

mpadge

dodgr_flows_si function

5

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...

mpadge

fix fundamental cycles

1

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...

mpadge