title: Max flow algorithm - Ford-Fulkerson's method
body: <p>I know I shouldn't ask this sort of question, but I'm hopeless atm, I need some help...</p>
  <p>I got this question for my assignment - there is a broad that has m by n grid of squares, and we are trying to cut the grid by two adjacent squares - either vertically or horizontally. However, some squares in the board cant be used as they are defective. so what's the maximum number of pieces we can cut?</p>
  <p>I was thinking using Ford-Fulkerson's method - that converts each square into vertex, but cant really figure out what should I do next...</p>
  <p>Can some one comes up with a hint?</p>
  <p>Many Thanks</p>