On Fri, Dec 18, 2009 at 12:54 AM, Michael Morrissey <[email protected]> wrote: > I'm looking for an efficient way to create all the unique, non-duplicated > permutations of a list (I believe these are called "necklaces" in > combinatorics). I need to do this without actually generating every possible > permutation (which includes all the duplicates).
This seems to do what you want: http://code.activestate.com/recipes/496819/ Kent _______________________________________________ Tutor maillist - [email protected] To unsubscribe or change subscription options: http://mail.python.org/mailman/listinfo/tutor
