| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Remove maxflow completely. | Simon Tatham | 2018-04-22 |
| | | | | | | | | | Its ability to solve general network flow problems was never actually used in this code base; it was _always_ used for the restricted problem of finding a matching in an unweighted bipartite graph. So now I've switched all its clients over to the new matching.c, maxflow is no longer needed. | ||
| * | New puzzle: `Tents'. Requires a potentially shared algorithms module | Simon Tatham | 2005-10-13 |
| maxflow.c. Also in this checkin, fixes to the OS X and GTK back ends to get ALIGN_VNORMAL right. This is the first time I've used it! :-) [originally from svn r6390] | |||
 |
index : puzzles | |
| My sgt-puzzles tree | Franklin Wei |
| aboutsummaryrefslogtreecommitdiff |