disjoint_set 1.0.0 
disjoint_set: ^1.0.0 copied to clipboard
Published 7 months ago • 
kator.dev
kator.devA highly efficient implementation of the Disjoint Set (Union-Find) data structure with union by rank and path compression optimizations.
1.0.0 #
Initial release of the disjoint_set package.
Features #
- Generic DisjointSet data structure with union-by-rank and path compression
- O(α(n)) time complexity for operations
- Comprehensive set management operations
- Full test coverage
- Serialization support
- Custom object support
- Advanced features (mergeIf, remove)
Implementation Details #
- Efficient implementation with union-by-rank optimization
- Path compression for near-constant time operations
- Complete documentation and examples
- Null safety support
- Dart 3.0+ compatibility
Metadata
2
likes
160
points
13
downloads
Publisher
Weekly Downloads
Metadata
A highly efficient implementation of the Disjoint Set (Union-Find) data structure with union by rank and path compression optimizations.
Repository (GitHub)
View/report issues
Contributing
Documentation
License
MIT (license)
