k-shortest: provide a shortest-path based implementation
Fix your initial attempt. Note that it appears that we are far from being the first ones to consider this issue, but most people use the name "best" for what we call lightest. See in particular this paper: http://www.cs.nyu.edu/~mohri/pub/nbest.ps. How to we compare?