incremental-tree-set-union

v0.1.1 Experimental

Gabow-Tarjan linear-time algorithm for incremental tree set union (JCSS 1985)

MIT Edition 2024 MSRV 1.85

Algorithms Data structures No standard library #tree#algorithm#union-find#linear-time#disjoint-set

GitHub ↗ crates.io ↗ Compare with…

Quick Verdict

✓Actively maintained (updated 5d ago)
!Pre-1.0: API may have breaking changes
✓Permissive license (MIT)

Security

Checking security advisories...

Downloads

Dependents

Releases

Size

106KB

Deep Insights

📊

Download activity

22 downloads in the last 30 days (1/day avg).

Health Breakdown

Maintenance 14/25

Recency, release consistency, active ratio

Quality 14/25

Yanked ratio, deps, size, maturity, features

Community 6/20

Reverse deps, ownership, ecosystem

Popularity 2/15

Downloads, momentum, growth trend

Documentation 12/15

Docs, repo, license, metadata

Download Trend

Daily downloads · last 90 days

0/day avg

Version Adoption

v0.1.1

55%

v0.1.0

45%

Release Timeline

2 releasessince 2026

2026

Less

Feature Flags

default =["std"]

std*

README

Loading README...

Maintainers

Luca Cappelletti

47 crates

Dependencies

direct dependencies