In the third programming assignment, we were given this graph and our goal is to comput the minimum cut.

I h've learned a super cool algorithm during this week of the course, the Karger's algorithm. This is a randomized algorithm, meaning that it does not always produce the correct result, but it's superfast, so running the same algorithm many times almost guarantees that we'll get the expected result.