mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 08:01:30 -07:00
Files
c3800c59d5
Thanks to Amir Livne Bar-on for contributing this. It's about to be used to build confidence in a rewrite of findloop.c in a followup commit. I also expect that it will be useful later on for testing other graph algorithms. This patch is not Amir's original. I've polished the code in various small ways. The biggest change is that when it outputs a failing graph, the graph is printed in the form of an Untangle game id, in the hope that that will make it possible to visualise easily while debugging the problem!
15 lines
593 B
CMake
15 lines
593 B
CMake
cliprogram(combi-test combi-test.c)
|
|
cliprogram(divvy-test divvy-test.c)
|
|
cliprogram(findloop-test findloop-test.c)
|
|
cliprogram(hatgen hatgen.c CORE_LIB COMPILE_DEFINITIONS TEST_HAT)
|
|
cliprogram(hat-test hat-test.c)
|
|
cliprogram(latin-test latin-test.c)
|
|
cliprogram(matching matching.c)
|
|
cliprogram(obfusc obfusc.c)
|
|
cliprogram(penrose-legacy-test penrose-legacy-test.c)
|
|
cliprogram(penrose-test penrose-test.c)
|
|
cliprogram(sort-test sort-test.c)
|
|
cliprogram(spectre-gen spectre-gen.c spectre-help.c CORE_LIB)
|
|
cliprogram(spectre-test spectre-test.c spectre-help.c)
|
|
cliprogram(tree234-test tree234-test.c)
|