A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks

Publisher Website

1 July 1973

journal article
Published by Association for Computing Machinery (ACM) in Journal of the ACM

Vol. 20 (3) , 389-390
https://doi.org/10.1145/321765.321769

Abstract

An error in Yen's algorithm is pointed out, and an alternative is offered which will produce correct results.

Keywords

This publication has 1 reference indexed in Scilit:

Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N ³ Additions and N ³ Comparisons
Journal of the ACM, 1972