A new implementation of Yen’s ranking loopless paths algorithm
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 o...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2003
|
| Texto completo: | http://hdl.handle.net/10316/7763 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/7763 |