[racket] shortest paths, resource allocation/scheduling

From: Mark Engelberg (mark.engelberg at gmail.com)
Date: Mon Dec 5 18:28:11 EST 2011

Check out Algorithm T in chapter of Knuth, volume 4A part 1.
Put your items into a vector, and use Algorithm T to generate the
indices of the elements to extract.

Posted on the users mailing list.