In edu.umd.cs.guitar.testcase.plugin.SequenceLengthCoverage:
generateWithLength(): Paths constructed are incorrect in terms of ordering,
noticeable when length is an odd number greater than or equal to 3. The
method's recursion first builds up a sequence of length (l-1) starting from
each event node (not caring if it marked 'initial' or not). Once this
sequence is built, a path is computed to the root from the *last* node of
this sequence, which gets prepended to the already existing sequence. This
is wrong for at least two reasons:
1) We should augment the path by finding a path from the *first* node of
the sequence to a root. Otherwise, we will have a potentially
malformed path that is wrong.
2) By augmenting *after* getting to (l-1) length, we may go over, because
we have no guarantees as to the length of the augmenting path that we
find (it may not always be 1). Thankfully, because there's another
bug in TCPlugin that handles the getPathToRoot method, we only ever
return augmenting paths of length 1. :(