Fix completion checking in Killer Solo.

[sgt-puzzles.git] / dsf.c

diff --git a/dsf.c b/dsf.c
index f60ddc0cbdb4b9a68e7fa5ab52c9f4ab9bb7ff03..aa22392661407f04abddec745b0a6e292db12aa5 100644 (file)
--- a/dsf.c
+++ b/dsf.c
@@ -165,7 +165,7 @@ void edsf_merge(int *dsf, int v1, int v2, int inverse)
         * We always make the smaller of v1 and v2 the new canonical
         * element. This ensures that the canonical element of any
         * class in this structure is always the first element in
-        * it.
+        * it. 'Keen' depends critically on this property.
         *
         * (Jonas Koelker previously had this code choosing which
         * way round to connect the trees by examining the sizes of