This article presents a novel shortest path algorithm for connected networks with nonnegative edge weights. The worst case running time of the single source shortest path version of the algorithm is O(max(m, )) where m is the number of edges of the input network and is the normalized eccentricity of the source vertex v_s. The pseudo-polynomial nature of the time complexity is overcome with a simple speed-up technique. The proposed approach can be implemented on a wide class of shortest path problems. Approximate solutions can be easily maintained in the preprocessing phase. An experimental efficiency analysis shows that the proposed approach outperforms existing algorithms in total computing time. The proposed algorithm is efficient for all classes of networks and particularly for networks with small diameter.

中文翻译：

---

最短路径问题的一种新的伪多项式方法

本文提出了一种新的最短路径算法，用于具有非负边权重的连接网络。算法的单源最短路径版本的最坏情况运行时间为O (max( m, )) 其中m是输入网络的边数并且是源顶点的归一化偏心率v _s. 时间复杂度的伪多项式性质可以通过简单的加速技术来克服。所提出的方法可以在广泛的最短路径问题上实施。在预处理阶段可以轻松维护近似解。实验效率分析表明，所提出的方法在总计算时间上优于现有算法。所提出的算法对于所有类别的网络都是有效的，特别是对于小直径的网络。