We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in $n^{2+o(1)}$ time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026).

翻译：本文研究具有实值（可能为负）边权有向图上的单源最短路径问题，通过改进Li、Li、Rao与Zhang（2026）提出的捷径构造方法，在$n^{2+o(1)}$时间内解决了该问题。