Skip to content

v1.0.0 Unequal leaf sets, indexing, and more!
Compare
Choose a tag to compare
@willdumm willdumm released this 24 May 15:43
· 137 commits to main since this release
v1.0.0
a687945
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

What's Changed

  • 8 more efficient merging by @williamhowardsnyder in #10 (Merging of many DAGs is now much more efficient)
  • Indexing Histories by @clarisw in #14 (history DAGs are now indexable, iterable containers, which support the | union operator (equivalent to merge method))
  • Supertrees by @willdumm in #12 (A history DAG may now be constructed from trees with different leaf label sets, as of #12. However, each tree's leaves must still be labeled uniquely)

New Contributors

Full Changelog: v0.1.3...v1.0.0

Contributors

clarisw, willdumm, and williamhowardsnyder
Assets 2