mark padgham

Dunno. The include flags (`-I`) are pulling in the C++ headers from `Rcpp`, `RcppEigen`, and `BH` for a "simple C file": ``` > Trying to compile a simple C file...

https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/findloop/ - especially the last algorithm, Tarjan's Bridge-finding algorithm, looks sound.

Thanks @Moohan for your contribution, which we both encourage and appreciate. In this case, however, the PR includes too many changes for us to include straight off. A few of...

Not at present, no. Current code could be adapted to implement it, but there's been no demand until now. If it was an important or interesting use case, I might...

Thanks @jamiedtor , that's definitely a use case that piques my interest. My motivation for all this work is advancing active travel in all ways possible. That sounds to me...

@jamiedtor I've figured out how I could implement an efficient probabilistic allocation algorithm. That would produce densities along each edges in a network accounting for the probabilities of every potential...

@FlxPo That's an interesting approach that could indeed be worth pursuing. I've just got the latest dodgr version on CRAN, and will prioritize addressing this issue for the next version....

@FlxPo Here's an in-principle demo of your idea. (Note that this uses [`m4ra::m4ra_hampi`](https://urbananalyst.github.io/m4ra/reference/m4ra_hampi.html) which is in SC-format, rather than the `sf` version here. Using `sf` can generate paths shorter than...

Here is a more realistic example on a much larger street network (from Essen, Germany): ``` r library (dodgr) f

That's very true indeed; thank you for picking that up! Those examples were used to inform the very first draft of this book, with many standards written after examples had...