I know LLMs are all the rage, but I’m genuinely shocked at the new fastest path algo for negative weight graphs. That’s awesome!
The CACM article discussed here at the time (just 3 months ago!): https://news.ycombinator.com/item?id=37275676
The relevant paper is https://arxiv.org/abs/2203.03456 and an improvement here https://arxiv.org/abs/2304.05279
I wonder if this will become standard curriculum for undergrads sooner rather than later. It's apparently a very simple and approachable method.