Consider the problem of dividing a graph into two parts. The links
in the graph have a weight. When the graph is split some links will
be cut. We want to minimize the sum of the weights of the links that are cut.
This is called the minimal cut of the graph.

The graph could model an organization. The nodes could be
actors in the organization and the weights could represent the importance
of their relations. When a reorganization requires a division,
the minimal cut could be the best way to allocate the
actors to the two new parts of the organization.