mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-20 07:31:30 -07:00
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!
This is the README accompanying the source code to Simon Tatham's puzzle collection. The collection's web site is at <https://www.chiark.greenend.org.uk/~sgtatham/puzzles/>. The puzzle collection is built using CMake <https://cmake.org/>. To compile in the simplest way (on any of Linux, Windows or Mac), run these commands in the source directory: cmake . cmake --build . The manual is provided in Windows Help format for the Windows build; in text format for anyone who needs it; and in HTML for the Mac OS X application and for the web site. It is generated from a Halibut source file (puzzles.but), which is the preferred form for modification. To generate the manual in other formats, rebuild it, or learn about Halibut, visit the Halibut website at <https://www.chiark.greenend.org.uk/~sgtatham/halibut/>.