Final project for my Algorithms class at Berkeley. Attempts to find the Maximum Leaf Spanning Tree (MLST) of a hard graph input.