The document proposes a new method for efficiently finding the top-k shortest simple paths between two nodes in a graph. It precomputes shortest path trees, transforms the graph, and uses optimizations like k-reduction and adaptive thresholds to terminate path searches early. Experimental results on real and synthetic graphs show the method outperforms prior algorithms by Yen and Hershberger for discovering top-k shortest paths.