recursion-ninja

I forgot about the time it takes to generate the hash! I imagine that for `(Word, Word)` it would be as simple as XOR, or XOR with a salt. Probably...

Yikes! That's way worse than I expected. Do you think `ByteArray` would behave better? I wrote `ByteString` in my example above, but what I actually had in mind was byte...

After a preorder pass, we assign "resolution cache" values to each node, and each resolution cache has a single character sequences in it. We were doing this because `PhylogeneticNode` requires...

Lets try and pull `Bio.Graph.Constructions` out of `pcg-core:pcg-data-strcutures` and into it's own sub-library or, even better, only defined and consumed in `app/pcg/`.

We should strongly consider representing the leaf nodes and the internal nodes in separate vectors with separate type parameters. This will allow us to express in the type system that...

Consider leveraging the `Ix` typeclass and `Array` the package when interacting with leaf, vertex, (root?) vectors as separate or combined objects.

I believe that we want to have separate internal node data and leaf data values. This would mean making the graph object a `Functor`, `Applicative`, and `Monad` with respect to...

Let's not assume the user has `nix` installed or wants it installed it for them. It adds to the user's machine an additional program which was not necessary to build...

I think we should put this in the `makefile`, both for convenience and a permanent reference. In the near future, perhaps we can use the `nix-shell` commands to address #127....

I think that we might be doing this already with the old graph representation during the Wagner build command to speed up the process of selecting the minimal edge on...