C++ implementation of UnionFind data structure, implemented by lazy approach with rank and path compression optimizations. Amortized time complexity is O(M log* N), N - number of nodes, M - amount of fuse and find operations. Worst case for single operation is O(log n).
-
Notifications
You must be signed in to change notification settings - Fork 0
ATsahikian/UnionFind
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Lazy implementation of UnionFind structure by rank and path compression optimizations
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published