# One last thing in the setup: certain squares can't be blocked (the exits and # so the edges in a min-cut exactly correspond to a minimum-size set of walls Making a square impassable corresponds to cutting one of these edges, # bottom of a node, so those are the only edges that can be in a min-cut of the # Then the only edges with finite capacity are the ones from the top to the
# square, and from each exit square to the sink. # There are edges of infinite capacity from the source to each protected
# of each square to the top of each adjacent square. Additionally, there is an edge of infinite capacity from the bottom # and a "bottom", with an edge of capacity 1 from the top to the bottom of each # Each passable square (swamp, plain, or exit) becomes two vertices, a "top" # "protected" locations) are unreachable from all room exits. # adding walls/ramparts) such that all of a certain set of locations (the # We want to compute the minimum number of squares to make impassable (by
0 kommentar(er)
