Make sure we're counting the nodes for the trivial suffix and the empty suffix.
After construction, add a label to each node in the suffix tree and record the number of nodes in the tree.
Add tests for node index labels.
Delete tests for counting nodes in the suffix tree. This is now tested in the suffix tree tests.
Delete node counting code. Add function to compute depth and first instance arrays for the LCA algorithm.
Add tests for depth and first instance arrays created during the Euler tour of the suffix tree.
Normalize indentation.