One approach: for each pair of vertices , compute the minimum - cut. The global minimum cut is the smallest among all these cuts. This is conceptually simple. There are pairs, and each min cut takes time with max flow.
Total time: , which is too slow for large graphs with thousands of vertices. You need a smarter algorithm like Stoer-Wagner that avoids checking all pairs explicitly.