Yen's algorithm

In graph theory, Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost.^[1] The algorithm was published by Jin Y. Yen in 1971 and employs any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path.^[2]

Notation	Description
${\displaystyle N}$	The size of the graph, i.e., the number of nodes in the network.
${\displaystyle (i)}$	The ${\displaystyle i}$-th node of the graph, where ${\displaystyle i}$ ranges from ${\displaystyle 1}$ to ${\displaystyle N}$. This means that ${\displaystyle (1)}$ is the source node of the graph, and ${\displaystyle (N)}$ is the sink node of the graph.
${\displaystyle d_{ij}}$	The cost of the edge between ${\displaystyle (i)}$ and ${\displaystyle (j)}$, assuming that ${\displaystyle (i)\neq (j)}$ and ${\displaystyle d_{ij}\geq 0}$.
${\displaystyle A^{k}}$	The ${\displaystyle k}$-th shortest path from ${\displaystyle (1)}$ to ${\displaystyle (N)}$, where ${\displaystyle k}$ ranges from ${\displaystyle 1}$ to ${\displaystyle K}$. Then ${\displaystyle A^{k}=(1)-(2^{k})-(3^{k})-\cdots -({Q_{k}}^{k})-(N)}$, where ${\displaystyle (2^{k})}$ is the 2nd node of the ${\displaystyle k}$-th shortest path, ${\displaystyle (3^{k})}$ is the 3rd node of the ${\displaystyle k}$-th shortest path, and so on.
${\displaystyle {A^{k}}_{i}}$	A deviation path from ${\displaystyle A^{k-1}}$ at node ${\displaystyle (i)}$, where ${\displaystyle i}$ ranges from ${\displaystyle 1}$ to ${\displaystyle Q_{k}}$. Note that the maximum value of ${\displaystyle i}$ is ${\displaystyle Q_{k}}$, which is the node just before the sink in the ${\displaystyle k}$ shortest path. This means that the deviation path cannot deviate from the ${\displaystyle k-1}$ shortest path at the sink. The paths ${\displaystyle A^{k}}$ and ${\displaystyle A^{k-1}}$ follow the same path until the ${\displaystyle i}$-th node, then ${\displaystyle (i)^{k}-(i+1)^{k}}$ edge is different from any path in ${\displaystyle A^{j}}$, where ${\displaystyle j}$ ranges from ${\displaystyle 1}$ to ${\displaystyle k-1}$.
${\displaystyle {R^{k}}_{i}}$	The root path of ${\displaystyle {A^{k}}_{i}}$ that follows that ${\displaystyle A^{k-1}}$ until the ${\displaystyle i}$-th node of ${\displaystyle A^{k-1}}$.
${\displaystyle {S^{k}}_{i}}$	The spur path of ${\displaystyle {A^{k}}_{i}}$ that starts at the ${\displaystyle i}$-th node of ${\displaystyle {A^{k}}_{i}}$ and ends at the sink.

The algorithm can be broken down into two parts: determining the first k-shortest path, ${\displaystyle A^{1}}$, and then determining all other k-shortest paths. It is assumed that the container ${\displaystyle A}$ will hold the k-shortest path, whereas the container ${\displaystyle B}$ will hold the potential k-shortest paths. To determine ${\displaystyle A^{1}}$, the shortest path from the source to the sink, any efficient shortest path algorithm can be used.

To find the ${\displaystyle A^{k}}$, where ${\displaystyle k}$ ranges from ${\displaystyle 2}$ to ${\displaystyle K}$, the algorithm assumes that all paths from ${\displaystyle A^{1}}$ to ${\displaystyle A^{k-1}}$ have previously been found. The ${\displaystyle k}$ iteration can be divided into two processes: finding all the deviations ${\displaystyle {A^{k}}_{i}}$ and choosing a minimum length path to become ${\displaystyle A^{k}}$. Note that in this iteration, ${\displaystyle i}$ ranges from ${\displaystyle 1}$ to ${\displaystyle {Q^{k}}_{k}}$.

The first process can be further subdivided into three operations: choosing the ${\displaystyle {R^{k}}_{i}}$, finding ${\displaystyle {S^{k}}_{i}}$, and then adding ${\displaystyle {A^{k}}_{i}}$ to the container ${\displaystyle B}$. The root path, ${\displaystyle {R^{k}}_{i}}$, is chosen by finding the subpath in ${\displaystyle A^{k-1}}$ that follows the first ${\displaystyle i}$ nodes of ${\displaystyle A^{j}}$, where ${\displaystyle j}$ ranges from ${\displaystyle 1}$ to ${\displaystyle k-1}$. Then, if a path is found, the cost of edge ${\displaystyle d_{i(i+1)}}$ of ${\displaystyle A^{j}}$ is set to infinity. Next, the spur path, ${\displaystyle {S^{k}}_{i}}$, is found by computing the shortest path from the spur node, node ${\displaystyle i}$, to the sink. The removal of previous used edges from ${\displaystyle (i)}$ to ${\displaystyle (i+1)}$ ensures that the spur path is different. ${\displaystyle {A^{k}}_{i}={R^{k}}_{i}+{S^{k}}_{i}}$, the addition of the root path and the spur path, is added to ${\displaystyle B}$. Next, the edges that were removed, i.e. had their cost set to infinity, are restored to their initial values.

The second process determines a suitable path for ${\displaystyle A^{k}}$ by finding the path in container ${\displaystyle B}$ with the lowest cost. This path is removed from container ${\displaystyle B}$ and inserted into container ${\displaystyle A}$, and the algorithm continues to the next iteration.

The algorithm assumes that the Dijkstra algorithm is used to find the shortest path between two nodes, but any shortest path algorithm can be used in its place.

function YenKSP(Graph, source, sink, K):     // Determine the shortest path from the source to the sink.     A[0] = Dijkstra(Graph, source, sink);     // Initialize the set to store the potential kth shortest path.     B = [];          for k from 1 to K:         // The spur node ranges from the first node to the next to last node in the previous k-shortest path.         for i from 0 to size(A[k − 1]) − 2:                          // Spur node is retrieved from the previous k-shortest path, k − 1.             spurNode = A[k-1].node(i);             // The sequence of nodes from the source to the spur node of the previous k-shortest path.             rootPath = A[k-1].nodes(0, i);                          for each path p in A:                 if rootPath == p.nodes(0, i):                     // Remove the links that are part of the previous shortest paths which share the same root path.                     remove p.edge(i,i + 1) from Graph;                          for each node rootPathNode in rootPath except spurNode:                 remove rootPathNode from Graph;                          // Calculate the spur path from the spur node to the sink.             // Consider also checking if any spurPath found             spurPath = Dijkstra(Graph, spurNode, sink);                          // Entire path is made up of the root path and spur path.             totalPath = rootPath + spurPath;             // Add the potential k-shortest path to the heap.             if (totalPath not in B):                 B.append(totalPath);                          // Add back the edges and nodes that were removed from the graph.             restore edges to Graph;             restore nodes in rootPath to Graph;                              if B is empty:             // This handles the case of there being no spur paths, or no spur paths left.             // This could happen if the spur paths have already been exhausted (added to A),              // or there are no spur paths at all - such as when both the source and sink vertices              // lie along a "dead end".             break;         // Sort the potential k-shortest paths by cost.         B.sort();         // Add the lowest cost path becomes the k-shortest path.         A[k] = B[0];         // In fact we should rather use shift since we are removing the first element         B.pop();          return A; 

The example uses Yen's K-Shortest Path Algorithm to compute three paths from ${\displaystyle (C)}$ to ${\displaystyle (H)}$. Dijkstra's algorithm is used to calculate the best path from ${\displaystyle (C)}$ to ${\displaystyle (H)}$, which is ${\displaystyle (C)-(E)-(F)-(H)}$ with cost 5. This path is appended to container ${\displaystyle A}$ and becomes the first k-shortest path, ${\displaystyle A^{1}}$.

Node ${\displaystyle (C)}$ of ${\displaystyle A^{1}}$ becomes the spur node with a root path of itself, ${\displaystyle {R^{2}}_{1}=(C)}$. The edge, ${\displaystyle (C)-(E)}$, is removed because it coincides with the root path and a path in container ${\displaystyle A}$. Dijkstra's algorithm is used to compute the spur path ${\displaystyle {S^{2}}_{1}}$, which is ${\displaystyle (C)-(D)-(F)-(H)}$, with a cost of 8. ${\displaystyle {A^{2}}_{1}={R^{2}}_{1}+{S^{2}}_{1}=(C)-(D)-(F)-(H)}$ is added to container ${\displaystyle B}$ as a potential k-shortest path.

Node ${\displaystyle (E)}$ of ${\displaystyle A^{1}}$ becomes the spur node with ${\displaystyle {R^{2}}_{2}=(C)-(E)}$. The edge, ${\displaystyle (E)-(F)}$, is removed because it coincides with the root path and a path in container ${\displaystyle A}$. Dijkstra's algorithm is used to compute the spur path ${\displaystyle {S^{2}}_{2}}$, which is ${\displaystyle (E)-(G)-(H)}$, with a cost of 7. ${\displaystyle {A^{2}}_{2}={R^{2}}_{2}+{S^{2}}_{2}=(C)-(E)-(G)-(H)}$ is added to container ${\displaystyle B}$ as a potential k-shortest path.

Node ${\displaystyle (F)}$ of ${\displaystyle A^{1}}$ becomes the spur node with a root path, ${\displaystyle {R^{2}}_{3}=(C)-(E)-(F)}$. The edge, ${\displaystyle (F)-(H)}$, is removed because it coincides with the root path and a path in container ${\displaystyle A}$. Dijkstra's algorithm is used to compute the spur path ${\displaystyle {S^{2}}_{3}}$, which is ${\displaystyle (F)-(G)-(H)}$, with a cost of 8. ${\displaystyle {A^{2}}_{3}={R^{2}}_{3}+{S^{2}}_{3}=(C)-(E)-(F)-(G)-(H)}$ is added to container ${\displaystyle B}$ as a potential k-shortest path.

Of the three paths in container ${\displaystyle B}$, ${\displaystyle {A^{2}}_{2}}$ is chosen to become ${\displaystyle A^{2}}$ because it has the lowest cost of 7. This process is continued to the 3rd k-shortest path. However, within this 3rd iteration, note that some spur paths do not exist. And the path that is chosen to become ${\displaystyle A^{3}}$ is ${\displaystyle (C)-(D)-(F)-(H)}$.

To store the edges of the graph, the shortest path list ${\displaystyle A}$, and the potential shortest path list ${\displaystyle B}$, ${\displaystyle N^{2}+KN}$ memory addresses are required.^[2] At worse case, the every node in the graph has an edge to every other node in the graph, thus ${\displaystyle N^{2}}$ addresses are needed. Only ${\displaystyle KN}$ addresses are need for both list ${\displaystyle A}$ and ${\displaystyle B}$ because at most only ${\displaystyle K}$ paths will be stored,^[2] where it is possible for each path to have ${\displaystyle N}$ nodes.

The time complexity of Yen's algorithm is dependent on the shortest path algorithm used in the computation of the spur paths, so the Dijkstra algorithm is assumed. Dijkstra's algorithm has a worse case time complexity of ${\displaystyle O(N^{2})}$, but using a Fibonacci heap it becomes ${\displaystyle O(M+N\log N)}$,^[3] where ${\displaystyle M}$ is the number of edges in the graph. Since Yen's algorithm makes ${\displaystyle Kl}$ calls to the Dijkstra in computing the spur paths, where ${\displaystyle l}$ is the length of spur paths. In a condensed graph, the expected value of ${\displaystyle l}$ is ${\displaystyle O(\log N)}$, while the worst case is ${\displaystyle N}$. The time complexity becomes ${\displaystyle O(KN(M+N\log N))}$.^[4]

Yen's algorithm can be improved by using a heap to store ${\displaystyle B}$, the set of potential k-shortest paths. Using a heap instead of a list will improve the performance of the algorithm, but not the complexity.^[5] One method to slightly decrease complexity is to skip the nodes where there are non-existent spur paths. This case is produced when all the spur paths from a spur node have been used in the previous ${\displaystyle A^{k}}$. Also, if container ${\displaystyle B}$ has ${\displaystyle K-k}$ paths of minimum length, in reference to those in container ${\displaystyle A}$, then they can be extract and inserted into container ${\displaystyle A}$ since no shorter paths will be found.

Eugene Lawler proposed a modification to Yen's algorithm in which duplicates path are not calculated as opposed to the original algorithm where they are calculated and then discarded when they are found to be duplicates.^[6] These duplicates paths result from calculating spur paths of nodes in the root of ${\displaystyle A^{k}}$. For instance, ${\displaystyle A^{k}}$ deviates from ${\displaystyle A^{k-1}}$ at some node ${\displaystyle (i)}$. Any spur path, ${\displaystyle {S^{k}}_{j}}$ where ${\displaystyle j=0,\ldots ,i}$, that is calculated will be a duplicate because they have already been calculated during the ${\displaystyle k-1}$ iteration. Therefore, only spur paths for nodes that were on the spur path of ${\displaystyle A^{k-1}}$ must be calculated, i.e. only ${\displaystyle {S^{k}}_{h}}$ where ${\displaystyle h}$ ranges from ${\displaystyle (i+1)^{k-1}}$ to ${\displaystyle (Q_{k})^{k-1}}$. To perform this operation for ${\displaystyle A^{k}}$, a record is needed to identify the node where ${\displaystyle A^{k-1}}$ branched from ${\displaystyle A^{k-2}}$.

• Yen's improvement to the Bellman–Ford algorithm

• Open Source C++ Implementation
• Open Source C++ Implementation using Boost Graph Library