A persistent implementation of the union-find data structure
Implemented by Jason Hemann and Dan Friedman.
Based on a design by Sylvain Conchon and Jean-Christophe Filliâtre.
See A Persistent Union-Find Data Structure. In ACM SIGPLAN Workshop on ML, pages 37-45, Freiburg, Germany, October 2007.
This implementation extends the paper by allowing new elements to be added to the set.
The Tidelift Subscription provides access to a continuously curated stream of human-researched and maintainer-verified data on open source packages and their licenses, releases, vulnerabilities, and development practices.
Learn more →
Something wrong with this page? Make a suggestion
Export .ABOUT file for this package
Last synced: 2024-04-26 02:02:08 UTC