[racket] shortest paths, resource allocation/scheduling

On Dec 5, 2011, at 4:24 PM, "Jos Koot" <jos.koot at telefonica.net> wrote:

> If there is a less-than predicate for the elements of the list, the list can
> be sorted and things may be speeded up, I think.

In fact, if there's a total, antisymmetric relation on the elements of the list, you don't even need to sort the list; you can just use the relation to make sure you don't double-count anything.

Stephen Bloch
sbloch at adelphi.edu