Reversal Distance (updated)

Implemented a greedy BFS algorithm based on reducing the number of break
points in a permutation.  This should yield the optimal reversal
distance for the vast majority of reversals, if not all reversals.
Closes #5.