This is a simple implementation of the disjoint sets data structure (union-find algorithm) in common lisp.
See the docstring and the tests for the documentation.
(ql:quickload "disjoint-sets")
(asdf:test-system "disjoint-sets")
BSD 2-clause
-
Notifications
You must be signed in to change notification settings - Fork 0
An implementation of the disjoint sets data structure (union-find algorithm) in common lisp.
License
fstamour/disjoint-sets
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An implementation of the disjoint sets data structure (union-find algorithm) in common lisp.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published