Graph Cutset

Description:

• A cut is to divide a graph to 2 sets of nodes S and $V-S$
• A cutset if the set of mimimum edges needed to remove to perform the cut
• ex:
  • If cut a and c, the cutset is a-b and c-e
  • if cut a, c, e, the cutset is a-b, b-e, d-e and e-g