tree-edit-distance
| Crates.io | tree-edit-distance |
| lib.rs | tree-edit-distance |
| version | 0.4.0 |
| source | src |
| created_at | 2020-05-09 18:02:05.12797 |
| updated_at | 2022-11-15 12:16:08.579254 |
| description | Find the lowest cost sequence of edits between two trees |
| homepage | |
| repository | https://github.com/brunocodutra/tree-edit-distance.git |
| max_upload_size | |
| id | 239332 |
| size | 29,395 |
Bruno Dutra (brunocodutra)
documentation
README
TreeEditDistance 
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.
Using TreeEditDistance
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
Contribution
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.
License
TreeEditDistance is distributed under the terms of the MIT license, see LICENSE for details.