Embed Notice

So, here are the bad parts:

- That justification for comparing sum of total path lengths as the comparison is a little lame. I need to put that on more solid ground.
- The output is OK, but not really stunning. In particular, there are a lot of swapped letters right next to each other.

The biggest bad part, though, is that finding *all* the paths between two nodes in a directed graph is an exponential problem. I can run with 5 letters just fine, but 26 letters doesn't work at all.