This note extends the general algebraic theory of network routing problems to the problem of finding the k best routes in a network. Techniques for solving linear equations in this extended algebra produce corresponding algorithms for determining the k best routes.