-
Committer:
John Arbash Meinel
-
Date:
2008-08-06 22:45:35 UTC
-
Revision ID:
john@arbash-meinel.com-20080806224535-nw726e1khk08fsd3
Found a problem with the algorithm.
Namely, when pruning nodes that are not in the graph, it is possible to prune
the first parent, which changes the right-parent to become the left-hand
parent. Which confuses a lot, because it makes the node look like it
is a descendant, rather than a merge.
Needs proper tests.