Home
Reading
Searching
Subscribe
Sponsors
Statistics
Posting
Contact
Spam
Lists
Links
About
Hosting
Filtering
Features Download
Marketing
Archives
FAQ
Blog
 
Gmane
From: <dgriffi3 <at> uiuc.edu>
Subject: ANNOUNCE: Derangement version 0.1.0
Newsgroups: gmane.comp.lang.haskell.cafe
Date: Tuesday 20th February 2007 02:37:01 UTC (over 10 years ago)
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
 
CD: 3ms