Linear Programmering

Hej, jeg har faget Linear programmering, også kaldet operations analyse. Vi har fået en opgave for, hvor jeg har løst part 1-3 og nu er jeg kommet til den sidste og er altså helt blank. Håber i kan hjælpe mig eller give mig et hint. Opgaven er formuleret nedenunder på engelsk 

Part IV: Max-flow min-cut

You are given an undirected graph with the set of nodes N and arcs A. Suppose we wish to partition the graph into two
components with the minimum number of arcs between the components.
1. How would you solve this partitioning problem?
(Hint: Recall that by determining the maximum flow between a source node s and a sink node t, you also
determine a certain minimum cut. You may need to transform the graph into a directed graph!)
2. How much computation time is needed for solving this problem? (Time measured relative to CPU, not in hours and
minutes.)
(Hint: How many times do you need to solve a certain type of problem?)