Find the lowest cost sequence of edits between two trees
MIT License
This crate provides an algorithm to compute the lowest cost sequence of edits between two trees. It is based on a recursive generalized version of the Levenshtein distance for arbitrary sequences, where inserting/deleting nodes may have an arbitrary user-defined cost.
TreeEditDistance is available on crates.io, simply add it as a dependency in your Cargo.toml
:
[dependencies]
tree-edit-distance = "0.4"
The full API documentation is available on docs.rs
TreeEditDistance is an open source project and you're very welcome to contribute to this project by opening issues and/or pull requests, see CONTRIBUTING for general guidelines.
TreeEditDistance is distributed under the terms of the MIT license, see LICENSE for details.