This is the inital version of a very small library, mostly using the functional graph library, to find a derangement of a set, or rather a list. A derangement of a set is a permutation with no fixed points, like many constrained matching problems it is susceptible to solution via a Max-flow algorithm. The source and its darcs repository is available at http://www.acm.uiuc.edu/~dgriffi3/projects/derangement/ Of course questions, comments and patches are welcome. -- Dennis Griffith, ACM@UIUC Treasurer