Lucas van der Meer
Lucas van der Meer
May be coming to the igraph R package soon: https://github.com/igraph/rigraph/issues/972 Once its there we can easily include it in the st_network_paths function
This is an issue that we have been talking about for a while. A problem is that tidygraph does not behave in the same way. In tidygraph you need to...
This is expected behaviour. In undirected networks igraph/tidygraph will always let the node with the lowest ID be the "from" node. Given that "from" and "to" does not have any...
Thanks @agila5, this is part of the new minor release. Much faster!
FYI, we also submitted a proposal for a 2h workshop to introduce the sfnetworks package, focusing on attendees that already have at least basic knowledge of R and r-spatial, or...
Great! For me mainly the `st_join` method with `stars` objects looks very interesting and fits nice into the work I am doing on data cubes now in Salzburg. I would...
Yes, I agree, if a shape goes outside of the area but enters it again later on, that part outside of the area should remain in the shape, such that...
The Travelling Salesman Problem finds the optimal route visiting a set of nodes, while (if I am right) the Chinese Postman Problem finds the optimal route visiting a set of...
Converting this to a Q&A discussion
Thanks @fnattino for showing your implementation. This is definitely something we want to include in `sfnetworks v1.0` before the real release. In the coming time I will have a closer...