Expand description

A graph representation for computing tree diffs.


Vertex 🔒
A vertex in a directed acyclic graph that represents a diff.


Edge 🔒
An edge in our graph, with an associated cost.
Tracks entering syntax List nodes.


Does this node look like punctuation?
Pop as many parents of lhs_node and rhs_node as 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 v.