Simple test for problem 1
Simple test for problem 2
Test with ties for problems 1 and 2
Simplify tiebreaking
Naive MST
Add heap pop
Union find plus prelim cluster reading
More asserts, read out clusters
Undo git screwup
Calculate minimum distance
Solve hamming distance clustering problem and fix union
Dynamic programming solution to knapsack problem
Add recursive/memoized knapsack algorithm
Initial, broken, optimal bst
Optimal BST