Here’s the scientific article: https://arxiv.org/pdf/2504.17033
The abstract (emphasis mine):
We give a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is the first result to break the O(m + n log n) time bound of Dijkstra’s algorithm on sparse graphs, showing that Dijkstra’s algorithm is not optimal for SSSP
So this article’s a bit clickbaity in that this algorithm only outperforms Dijkstra’s in those specific cases, which aren’t uncommon, but Dijkstra’s is still king for undirected graphs, or graphs with negative edge weights. Still very neat.
Create an account to read the full story.
lmao not a chance
Ah, algorithms, my moral enemy
That’s an interesting autocorrect slip, lol. Always do the right thing!
lol I was on my phone, and looked at it soon after. I am not quite sure if it was autocorrect or me. I have many feelings on the matter and it was my only middling grade in university
the only thing worse than algorithms are data structures…
so basically the entirety of cs
I’m like data structures, I think of myself as a plumber connecting pipes holding streams of data . Just my head hurts when I think about what some of those functions are doing. Algos hidden layers deep under my code… plotting, waiting to make me feel dumb
