mark padgham
mark padgham
The "routes" tables have [a "route_type" column](https://developers.google.com/transit/gtfs/reference#routestxt) which specifies: - 0 Tram, Streetcar, Light rail. Any light rail or street level system within a metropolitan area. - 1 Subway, Metro....
Got kicked off because of #111. Have to re-instate it.
Develop an algorithm to return a distance, rather than time, matrix between all stops in a GTFS feed. Primary advantage is the ability to assess the overall "speed" of a...
It would be useful to develop functions to return max or min distances, rather than all distances. Particularly useful in use cases with large inputs, say two relatively large 2-D...
Just to compare compilation times for Dirk
That's what's missing to get coverage back up to 100%
This would require a pretty extensive restructure of current code, but the kind of unrolling I discovered via @njtierney [here](https://github.com/njtierney/maxcovr/issues/20), and explained in [this blog post](https://privefl.github.io/blog/Tip-Optimize-your-Rcpp-loops/) might offer even more...
@mdsumner dunno whether this has been discussed elsewhere (alas it's a bit hard to accurately search for "c" :smirk: ), but is there a `c` method to join multiple silicate...
Might be jumping ahead of things, but `dodgr` has made me realise there'll be a world of applications which involve analysing relatinoships between objects. Classic example is graph/network relationships and...
It'll be necessary to implement a function to extract neighbours from a `TRI` object, or maybe even include them as part of it? Also some work to do in `TRI`-land:...