Ecosyste.ms: Packages

An open API service providing package, version and dependency metadata of many open source software ecosystems and registries.

crates.io "union-find" keyword

range_union_find 0.5.0
A union-find data structure for ranges
11 versions - Latest release: 12 months ago - 1 dependent package - 2 dependent repositories - 4.21 thousand downloads total - 2 stars on GitHub - 1 maintainer
pulau-rs 0.2.0 💰
allocation-free union-find library for bare metal environments
2 versions - Latest release: over 1 year ago - 788 downloads total - 8 stars on GitHub - 1 maintainer
uf_rush 0.2.1
A lock-free, thread-safe implementation of the Union-Find (Disjoint-Set) data structure.
4 versions - Latest release: 4 months ago - 1.28 thousand downloads total - 2 stars on GitHub - 1 maintainer
ascent-byods-rels 0.6.0
data structures for Ascent relations, made possible by Ascent's BYODS feature
4 versions - Latest release: about 2 months ago - 1.32 thousand downloads total - 367 stars on GitHub - 1 maintainer
unifier_set 0.2.0
A generic unifier set (disjoint set, union-find) datastructure for use in unification algorithms.
1 version - Latest release: 4 months ago - 339 downloads total - 0 stars on GitHub - 1 maintainer
Top 4.2% on crates.io
ena 0.14.3
Union-find, congruence closure, and other unification code. Based on code from rustc.
26 versions - Latest release: 23 days ago - 21 dependent packages - 2,157 dependent repositories - 14.4 million downloads total - 140 stars on GitHub - 1 maintainer
disjoint-sets 0.4.2
Three union-find implementations
15 versions - Latest release: almost 6 years ago - 9 dependent packages - 18 dependent repositories - 51.4 thousand downloads total - 14 stars on GitHub - 1 maintainer
reunion 0.1.14
A generic implementation of the Union-Find w/ Rank data structure.
14 versions - Latest release: over 2 years ago - 1 dependent repositories - 4.79 thousand downloads total - 2 stars on GitHub - 1 maintainer
wuf 0.1.2
A fast weighted implementation to the union-find problem with path compression.
3 versions - Latest release: over 5 years ago - 1.73 thousand downloads total - 0 stars on GitHub - 1 maintainer
partitions 0.2.4
A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a ...
6 versions - Latest release: over 5 years ago - 5 dependent packages - 23 dependent repositories - 245 thousand downloads total - 8 stars on GitHub - 1 maintainer
cozad-union-find 1.1.0
An implementation of the union-find disjoint set graph algorithm
3 versions - Latest release: about 2 years ago - 1.06 thousand downloads total - 2 stars on GitHub - 1 maintainer
aph_disjoint_set 0.1.1
Disjoint set implementation with optimized memory usage and ability to detach elements.
2 versions - Latest release: 12 months ago - 627 downloads total - 1 maintainer
disjoint-hash-set 1.0.0
A disjoint set / union-find data structure suitable for incremental tracking of connected compone...
1 version - Latest release: almost 2 years ago - 1 dependent repositories - 2.44 thousand downloads total - 0 stars on GitHub - 1 maintainer