puzzles/maxflow.c, branch master My sgt-puzzles tree Remove maxflow completely. 2018-04-22T16:04:50+00:00 Simon Tatham anakin@pobox.com 2018-04-21T16:03:10+00:00 3d04dd3335a2c4c6007ff4e2a58a2855c7a9c52a 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. 
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.
fix loop condition 2017-10-07T21:36:49+00:00 Stefan Bühler stbuehler@web.de 2017-10-07T21:21:45+00:00 00e23909f8599686ae8aa975a7f5a443a500516f prev[sink] == 0 means there was a path found with the last step being a forward edge to the sink, and the edge being at index 0 in the array. This is a valid path (the same as any other path indicated by prev[sink] > 0). 
prev[sink] == 0 means there was a path found with the last step being a
forward edge to the sink, and the edge being at index 0 in the array.

This is a valid path (the same as any other path indicated by prev[sink]
> 0).
New puzzle: `Tents'. Requires a potentially shared algorithms module 2005-10-13T18:30:24+00:00 Simon Tatham anakin@pobox.com 2005-10-13T18:30:24+00:00 669bb81f084191d0163de43c8e1631e30d913b00 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] 
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]