Yen's algorithm - shortest path - Graphs
Hey everyone! (Happy)
I'm a CS student but I must take some math classes too. One of them is graph algorithms.
I have this homework to calculate shortest paths from a node to all the other nodes (or vertexes, don't know the correct terms in English) with Yen's algorithm. The problem is that I can't find a good description or pseudocode for Yen's algorithm. It always appears as a side-note for the Bellman-Ford algorithm, without a full description.
Can anyone help me out and provide me with a pseudocode for Yen's algorithm?
Thanks a lot!
p.s. I hope I posted in the right section.