chiark / gitweb /
~ian / sgt-puzzles.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: dcc4d82) | patch
Remove maxflow completely.
authorSimon Tatham <anakin@pobox.com>
Sat, 21 Apr 2018 16:03:10 +0000 (17:03 +0100)
committerSimon Tatham <anakin@pobox.com>
Sun, 22 Apr 2018 16:04:50 +0000 (17:04 +0100)
commit3d04dd3335a2c4c6007ff4e2a58a2855c7a9c52a
tree36811a811450982e48e806097d156c47e802ad42tree | snapshot
parentdcc4d82b23095b07673d7c13cb2439c738a67fa1commit | diff
Remove maxflow completely.

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.
maxflow.c [deleted file] blob | history
maxflow.h [deleted file] blob | history
Unnamed repository; edit this file 'description' to name the repository.