{"id":17188741,"url":"https://github.com/brunocodutra/tree-edit-distance","last_synced_at":"2025-04-13T19:21:04.644Z","repository":{"id":42230990,"uuid":"260890623","full_name":"brunocodutra/tree-edit-distance","owner":"brunocodutra","description":"Find the lowest cost sequence of edits between two trees","archived":false,"fork":false,"pushed_at":"2025-02-08T18:11:28.000Z","size":59,"stargazers_count":6,"open_issues_count":2,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-27T10:01:40.426Z","etag":null,"topics":["diff","distance","edit","levenshtein","trees"],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/brunocodutra.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-05-03T11:05:46.000Z","updated_at":"2024-10-12T11:50:10.000Z","dependencies_parsed_at":"2024-08-21T01:06:39.562Z","dependency_job_id":null,"html_url":"https://github.com/brunocodutra/tree-edit-distance","commit_stats":{"total_commits":73,"total_committers":3,"mean_commits":"24.333333333333332","dds":"0.17808219178082196","last_synced_commit":"bf124412f3c0e9031c3161dc714afd0a1342f64c"},"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brunocodutra%2Ftree-edit-distance","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brunocodutra%2Ftree-edit-distance/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brunocodutra%2Ftree-edit-distance/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/brunocodutra%2Ftree-edit-distance/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/brunocodutra","download_url":"https://codeload.github.com/brunocodutra/tree-edit-distance/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248190548,"owners_count":21062285,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["diff","distance","edit","levenshtein","trees"],"created_at":"2024-10-15T01:09:44.104Z","updated_at":"2025-04-13T19:21:04.619Z","avatar_url":"https://github.com/brunocodutra.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TreeEditDistance [![docs.badge]][docs.home] [![codecov.badge]][codecov.home]\n\nThis crate provides an algorithm to compute the lowest cost sequence of edits between two trees.\nIt is based on a recursive generalized version of the [Levenshtein distance][levenshtein] for\narbitrary sequences, where inserting/deleting nodes may have an arbitrary user-defined cost.\n\n## Using TreeEditDistance\n\nTreeEditDistance is available on [crates.io], simply add it as a dependency in your `Cargo.toml`:\n\n```\n[dependencies]\ntree-edit-distance = \"0.4\"\n```\n\nThe full API documentation is available on [docs.rs][docs.home]\n\n## Contribution\n\nTreeEditDistance is an open source project and you're very welcome to contribute to this project by\nopening [issues] and/or [pull requests][pulls], see [CONTRIBUTING] for general\nguidelines.\n\n## License\n\nTreeEditDistance is distributed under the terms of the MIT license, see [LICENSE] for details.\n\n[crates.io]:        https://crates.io/crates/tree-edit-distance\n\n[docs.home]:        https://docs.rs/tree-edit-distance\n[docs.badge]:       https://docs.rs/tree-edit-distance/badge.svg\n\n[codecov.home]:     https://codecov.io/gh/brunocodutra/tree-edit-distance\n[codecov.badge]:    https://codecov.io/gh/brunocodutra/tree-edit-distance/branch/master/graph/badge.svg\n\n[issues]:           https://github.com/brunocodutra/tree-edit-distance/issues\n[pulls]:            https://github.com/brunocodutra/tree-edit-distance/pulls\n\n[LICENSE]:          https://github.com/brunocodutra/tree-edit-distance/blob/master/LICENSE\n[CONTRIBUTING]:     https://github.com/brunocodutra/tree-edit-distance/blob/master/CONTRIBUTING.md\n\n[levenshtein]:      https://en.wikipedia.org/wiki/Levenshtein_distance\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrunocodutra%2Ftree-edit-distance","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbrunocodutra%2Ftree-edit-distance","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbrunocodutra%2Ftree-edit-distance/lists"}