online advertising

Monday, November 2, 2015

Algorithms: Design and Analysis, Part 1 - Programming Question 3

Problem:

Compute the size of the minimum cut of a given graph using the Karger's algorithm

Solution:

I am almost ashamed to post this code because it is really bad. I am running out of time real bad so I will do anything to solve the problem. I know I can improve the algorithm by order of magnitude by doing proper indexing


No comments:

Post a Comment