GitHub - glwhart/enum4: Surjective-resolution enhanced version of the fixed-concentration enumeration code

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
#test.txt#		#test.txt#
.gitignore		.gitignore
README		README
color_constructor.py		color_constructor.py
color_constructor.py~		color_constructor.py~
crossout.py		crossout.py
crossout.py~		crossout.py~
enum4.py		enum4.py
enum4_noclass1.py		enum4_noclass1.py
enum4mixedRadix.py		enum4mixedRadix.py
enum4mixedRadix.py~		enum4mixedRadix.py~
enum4only_mixedRadix.py		enum4only_mixedRadix.py
enum4treeApproach.py		enum4treeApproach.py
enum4treeApproach.py~		enum4treeApproach.py~
grouper.py		grouper.py
grouper.py~		grouper.py~
grouper_tester.py		grouper_tester.py
grouper_tester.py~		grouper_tester.py~
inside_out.py		inside_out.py
inside_out.py~		inside_out.py~
lc_example.py		lc_example.py
lc_example.py~		lc_example.py~
mixed_radix_counter.py		mixed_radix_counter.py
mixed_radix_counter.py~		mixed_radix_counter.py~
msgenum.py		msgenum.py
msgenum.pyc		msgenum.pyc
msgenum.py~		msgenum.py~
msgenum3.py		msgenum3.py
msgenum3.py~		msgenum3.py~
perms.pdf		perms.pdf
perms.py		perms.py
perms.py~		perms.py~
perms2.pdf		perms2.pdf
perms_polly.pdf		perms_polly.pdf
test_cycle_counter.py		test_cycle_counter.py
test_partition.py		test_partition.py
test_polya.py		test_polya.py
testing.out		testing.out
tree.py		tree.py
tree.pyc		tree.pyc
tree.py~		tree.py~
tree1.py		tree1.py
tree1.py~		tree1.py~
tree2.py		tree2.py
tree2.py~		tree2.py~
treeclass.py		treeclass.py
treeclass.py~		treeclass.py~

Repository files navigation

In this directory, I'm testing algorithms for a surjective
resolution-based approach to fixed-concentration enumeration.

Preliminary tests indicate it will be much faster (better
scaling) than the enum3 algorithm published in CMS