Re: [racket] shortest paths, resource allocation/scheduling

[Mark Engelberg]

Check out Algorithm T in chapter 7.2.1.3 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.
_________________________________________________
  For list-related administrative tasks:
  http://lists.racket-lang.org/listinfo/users