This paper presents a new deterministic algorithm for single-source shortest paths (SSSP) on real non-negative edge-weighted directed graphs, with running time $O(m\sqrt{\log n}+\sqrt{mn\log n\log \log n})$, which is $O(m\sqrt{\log n\log \log n})$ for sparse graphs. This improves the recent breakthrough result of $O(m\log^{2/3} n)$ time for directed SSSP algorithm [Duan, Mao, Mao, Shu, Yin 2025].

翻译：本文提出了一种针对实数非负边权有向图的单源最短路径确定性新算法，其时间复杂度为$O(m\sqrt{\log n}+\sqrt{mn\log n\log \log n})$，对于稀疏图可简化为$O(m\sqrt{\log n\log \log n})$。该结果改进了近期有向图单源最短路径算法$O(m\log^{2/3} n)$时间复杂度的突破性成果[Duan, Mao, Mao, Shu, Yin 2025]。