Abstract
Determining the shortest route through a network is a problem for which many solutions have appeared. Not so well known, but of equal importance, is the generalized problem of determining the kth best route through a network. The purpose of this Letter is to present a formulation of the generalized problem, to reference several known solutions, and to describe a new simple method of solution which possesses some advantages.