https://github.com/samth/persistent-union-find

https://github.com/samth/persistent-union-find

Last synced: 6 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/samth/persistent-union-find
• Owner: samth
• Created: 2014-05-12T22:38:36.000Z (about 12 years ago)
• Default Branch: master
• Last Pushed: 2014-11-09T15:19:23.000Z (over 11 years ago)
• Last Synced: 2025-03-17T18:01:24.313Z (over 1 year ago)
• Language: Racket
• Size: 156 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
## Persistent union-find

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.