https://github.com/sebouellette/fast-unionfind

An O(1) (worst case for both union and find) algorithm for the union-find problem
https://github.com/sebouellette/fast-unionfind

Last synced: 5 months ago
JSON representation

An O(1) (worst case for both union and find) algorithm for the union-find problem

• Host: GitHub
• URL: https://github.com/sebouellette/fast-unionfind
• Owner: SebOuellette
• License: gpl-3.0
• Created: 2022-03-11T02:47:21.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2023-07-16T19:26:55.000Z (about 2 years ago)
• Last Synced: 2025-05-13T00:52:53.170Z (5 months ago)
• Language: C
• Size: 18.6 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Fast-UnionFind

An O(1) (worst case for both union and find) algorithm for the union-find problem

## Disclaimer

The main.c file just uses the algorithm, and does all the memory management, so it is a bit bulky since this is written in C. To see the actual algorithm, look in the DataTypes.c and DataTypes.h files. 

## Original Plan

I came up with this while I was at work, so I wrote it down on a piece of cardboard.. Here's that plan if you can make any of it out. 

![Original plan](https://cdn.honeybeeks.net/shQaf0poGA.jpg)