Implementation and Brief Experimental Analysis of the Duan et al. (2025) Algorithm for Single-Source Shortest Paths · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2511.03007/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTImplementation and Brief Experimental Analysis of the Duan et al. (2025) Algorithm for Single-Source Shortest Paths — mentioned by conmakhttps://news.ycombinator.com/item?id=47151782urn:hackerpapers:mention:2511.03007:47151782Wed, 25 Feb 2026 14:17:05 GMT<p>As a researcher at MIT who has worked on the BMSSP problem, the algorithm this is claiming to implement, this is not a BMSSP implementation. I am not even sure what it is, but the code is AI Slop. If you want to see actual research (which shows that shows BMSSP is actually far slower for any realistic sized network), check out: C++ https://github.com/lcs147/bmssp https://arxiv.org/abs/2511.03007 Python -&gt; BMSSPy https://papers.ssrn.com/sol3/papers.cfm?abstract_id=5777186 https://github.com/connor-makowski/bmsspy</p><p><a href="https://hackerpaper.kaipfister.de/p/2511.03007/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS