Peter Empen

Could you please elaborate on the above statement "We don't expect Chill serialization to be stable across jvm launches/recompiles"? We do expect registration numbers to be stable. How do you...

Our use case spans Akka Distributed _and_ Event Stores. We are confident that, once registry numbers are dealt with care, we do achieve kinda long-term format. For this purpose, we...

We do have these tests already. Yeh, we did realize upgrading Kryo over major releases won't be possible. Why do you think we will be hit by this restriction seriously?...

Yeah, `readEither` sounds really good, I'm not opinionated. In Circe `decode` returns the same. Is that something you'd do soon or do you prefer me to give it a try?...

OK. To finalize the signature, is it correct to assume that `read` always fails fast? Otherwise we better use a type that allows to return any number of failures. And,...

1. Concerning [PR 317](https://github.com/lihaoyi/upickle/pull/317), how can I compile against Scala 2.11 in _mill_ locally? I tried `upickle.jvm("2.11.12").compile()` but it does not work. 2. Also, what is your preferred strategy to...

@lihaoyi Waiting for your kind review of https://github.com/lihaoyi/upickle/pull/317...

The easiest way is https://www.baeldung.com/cs/simple-paths-between-two-vertices but look out, it has quite a high complexity. If your graph is bigger consider suggestions like https://mathoverflow.net/questions/18603/finding-all-paths-on-undirected-graph.

Could you please tell about your use case?

Since `shortestPathTo` is calculated by utilizing Dijkstra's algorithm it won't handle negativ weights as you'd expect. Providing Bellman-Ford would be a valid enhancement request. However, once you know you need...