A graph representation for computing tree diffs.
A vertex in a directed acyclic graph that represents a diff.
Tracks entering syntax List nodes.
Does this node look like punctuation?
Pop as many parents of
possible. Return the new syntax nodes and parents.
Compute the neighbours of
v if we haven’t previously done so,
and write them to the .neighbours cell inside