Re:enclose.horse
by nickponline on Tuesday January 06, 2026 @11:09AM
(#46514160)
I think this problem is called the maximum-weight closure and can be solved as max flow. You want to find a cut between source (horse) so they were no out-going edges not in the cut (escape routes).
[ Parent
| on HN ]
It's not the same problem. First, it's not directed, second it's a vertex separation problem.
Re:enclose.horse
by nickponline on Tuesday January 06, 2026 @11:51AM
(#46514785)
Ah yes quite right.