General Trees

Ka and Chung developed the algorithm for the general labeling based on the principle that after assigning the maximum edge length (and hence vertex labels $n-1$ and 0), the next edge length must be adjacent to some vertex already labeled.

As a group we refined the algorithm to check for one or two minor edge cases, and the general labeling was finished.