Given the network below we wish to do damage to this network i.e. remove arcs so that one cannot get from the source node to the sink node. Assume the number on each arc represents the costs of removing that arc. Find the arcs to remove that minimize the cost.
Describe your algorithm completely and go through the steps to find the solution. Given the network below we wish to do damage to this network i.e. remove arcs so that one cannot get from the source node to the sink node. Assume the number on each arc represents the costs of removing that arc. Find the arcs to remove that minimize the cost.
Describe your algorithm completely and go through the steps to find the solution.
Attachments: