mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 16:05:44 -07:00
Files
ac6fd11dda
The previous approach of scanning the grid by depth-first search was fine for deciding whether it was connected, but not so good for pointing out where the mistake was in the grid. Replaced that code with a dsf-based version, which identifies all connected components so that an easy followup pass can highlight all but the largest as erroneous. [originally from svn r10223]
22 lines
352 B
Makefile
22 lines
352 B
Makefile
# -*- makefile -*-
|
|
|
|
RANGE_EXTRA = dsf
|
|
|
|
range : [X] GTK COMMON range RANGE_EXTRA range-icon|no-icon
|
|
|
|
range : [G] WINDOWS COMMON range RANGE_EXTRA range.res|noicon.res
|
|
|
|
ALL += range[COMBINED] RANGE_EXTRA
|
|
|
|
!begin am gtk
|
|
GAMES += range
|
|
!end
|
|
|
|
!begin >list.c
|
|
A(range) \
|
|
!end
|
|
|
|
!begin >gamedesc.txt
|
|
range:range.exe:Range:Visible-distance puzzle
|
|
!end
|