tree-edit-distance: Tree Edit Distance to determine the similarity between two trees

[ algorithms, bsd3, library, program ] [ Propose Tags ] [ Report a vulnerability ]

Dynamic Programming algorithm by Zhang Shasha to calculate the Tree Edit Distance


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0
Change log CHANGELOG.md
Dependencies array, base (>=4.7 && <5), containers, intmap-graph, text, tree-edit-distance, vector [details]
License BSD-3-Clause
Copyright 2024 Tillmann Vogt
Author Tillmann Vogt
Maintainer tillk.vogt@gmail.com
Category algorithms
Home page https://github.com/tkvogt/tree-edit-distance#readme
Bug tracker https://github.com/tkvogt/tree-edit-distance/issues
Source repo head: git clone https://github.com/tkvogt/tree-edit-distance
Uploaded by TillmannVogt at 2025-02-06T10:31:24Z
Distributions
Executables tree-edit-distance-exe
Downloads 15 total (15 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2025-02-06 [all 1 reports]

Readme for tree-edit-distance-0.1.0.0

[back to package description]

Tree Edit Distance after Zhang Shasha

This library is a translation of https://github.com/ijkilchenko/ZhangShasha , inspired also by https://jelv.is/blog/Lazy-Dynamic-Programming/

You can it this with:

stack ghci

ghci> zhangShasha testGraph0 testGraph1
8
ghci>