Use the new matching() for latin.c.

The new client code is a lot smaller and nicer, because we can throw
away the col[] and num[] permutations entirely.

Of course, this also means that every puzzle that incorporated latin.c
now has to link against matching.c instead of maxflow.c - but since I
centralised that secondary dependency into Recipe a few commits ago,
it's trivial to switch them all over at once.

1 files changed, 1 insertions, 1 deletions

diff --git a/Recipe b/Recipe
index 822afb9..fc9bc1b 100644
--- a/Recipe
+++ b/Recipe
@@ -31,7 +31,7 @@ STANDALONE = nullfe random misc malloc
 
 ALL      = list
 
-LATIN_DEPS   = maxflow tree234
+LATIN_DEPS   = matching tree234
 LATIN        = latin LATIN_DEPS
 LATIN_SOLVER = latin[STANDALONE_SOLVER] LATIN_DEPS