Can someone tell me of a good algorithm to partition a set of n elements into m non-empty, disjoint subsets, where each subset has size k?
-- http://mail.python.org/mailman/listinfo/python-list
Can someone tell me of a good algorithm to partition a set of n elements into m non-empty, disjoint subsets, where each subset has size k?
-- http://mail.python.org/mailman/listinfo/python-list