suzanne.soy/UnionFind
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Christian Rinderknecht 2018-08-12 15:06:16 +02:00 committed by GitHub
parent 2d994efcd2
commit 9acfbfc781
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -14,23 +14,23 @@ the classes are always the original object.
The module `PartitionMain` tests each with the same equivalence The module `PartitionMain` tests each with the same equivalence
relations. relations.
# `Partition0.ml` ## `Partition0.ml`
This is a naive, persistent implementation of Union/Find featuring an This is a naive, persistent implementation of Union/Find featuring an
asymptotic worst case cost of O(n^2). asymptotic worst case cost of O(n^2).
# `Partition1.ml` ## `Partition1.ml`
This is a persistent implementation of Union/Find with height-balanced This is a persistent implementation of Union/Find with height-balanced
forests and without path compression, featuring an asymptotic worst forests and without path compression, featuring an asymptotic worst
case cost of O(n*log(n)). case cost of O(n*log(n)).
# `Partition2.ml` ## `Partition2.ml`
This is an alternate version of `Partition1.ml`, using a different This is an alternate version of `Partition1.ml`, using a different
data type. data type.
# `Partition3.ml` ## `Partition3.ml`
This is a destructive implementation of Union/Find with This is a destructive implementation of Union/Find with
height-balanced forests but without path compression, featuring an height-balanced forests but without path compression, featuring an