A new implementation of Yen’s ranking loopless paths algorithm

  • Ernesto Q. V. Martins
  • Marta M. B. PascoalEmail author


Yen’s algorithm is a classical algorithm for ranking the K shortest loopless paths between a pair of nodes in a network. In this paper an implementation of Yen’s algorithm is presented. Both the original algorithm and this implementation present \({\cal O}(Kn(m + n\log n))\) computational complexity order when considering a worst-case analysis. However, computational experiments are reported, which allow to conclude that in practice this new implementation outperforms two other, Perko’s implementation and a straightforward one.


network path loopless path paths ranking. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003

Authors and Affiliations

  • Ernesto Q. V. Martins
    • 1
  • Marta M. B. Pascoal
    • 1
    Email author
  1. 1.Centro de Informática e Sistemas and Departamento de MatemáticaUniversidade de CoimbraCoimbraPortugal

Personalised recommendations