Function tree_edit_distance::diff

pub fn diff<N, W>(a: &N, b: &N) -> (Box<[Edit]>, W) where
    N: Node<'n, Weight = W>,
    W: Default + Copy + Ord + Add<Output = W>, 

Finds the lowest cost sequence of Edits that transforms one tree of Nodes into the other.

The sequence of Edits is understood to apply to the left-hand side so it becomes the right-hand side.