- Page 382 - Section 5.6
Combinatorial Object Server -- You can generate many different types of combinatorial objects, including combinations, permutations, set partitions, spanning trees, permutations, and derangements at the Combinatorial Object Server here.
http://www.theory.cs.uvic.ca/~cos/gen/perm.html
(Added: Fri Jul 28 2006)
- Page 384 - Section 5.6
Combinatorial Object Server -- The Combinatorial Object Server, developed by Frank Ruskey, provides interactive programs for generating all the permutations, all the k-permutations, all the combinations, and all the combinations with at most k elements of a set with n elements, where n and k cannot exceed some reasonable large values. It also has programs for generating all the permutations and combinations of a multiset, which can be used to generate permutations and combinations when repetition of objects is allowed. Source code in C and/or Pascal can be downloaded for many of these programs. You can generate all the solutions to the n-queens problem in Section 10.4.
http://www.theory.cs.uvic.ca/~cos/cos.html
(Added: Fri Jul 28 2006)
- Page 384 - Section 5.6
Combinatorial Object Server -- You can generate many different types of combinatorial objects, including combinations, permutations, set partitions, spanning trees, permutations, and derangements at the Combinatorial Object Server here.
http://www.theory.cs.uvic.ca/~cos/gen/perm.html
(Added: Fri Jul 28 2006)
|
