{"id":18473978,"url":"https://github.com/sebouellette/fast-unionfind","last_synced_at":"2025-05-13T00:52:59.389Z","repository":{"id":109729323,"uuid":"468584909","full_name":"SebOuellette/Fast-UnionFind","owner":"SebOuellette","description":"An O(1) (worst case for both union and find) algorithm for the union-find problem","archived":false,"fork":false,"pushed_at":"2023-07-16T19:26:55.000Z","size":19,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-13T00:52:53.170Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SebOuellette.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-03-11T02:47:21.000Z","updated_at":"2024-01-13T05:27:13.000Z","dependencies_parsed_at":"2024-12-25T10:41:45.323Z","dependency_job_id":"4303d590-3eb8-4e22-803f-23835fe5eb33","html_url":"https://github.com/SebOuellette/Fast-UnionFind","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SebOuellette%2FFast-UnionFind","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SebOuellette%2FFast-UnionFind/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SebOuellette%2FFast-UnionFind/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SebOuellette%2FFast-UnionFind/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SebOuellette","download_url":"https://codeload.github.com/SebOuellette/Fast-UnionFind/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253850891,"owners_count":21973672,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-06T10:27:39.501Z","updated_at":"2025-05-13T00:52:59.361Z","avatar_url":"https://github.com/SebOuellette.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Fast-UnionFind\nAn O(1) (worst case for both union and find) algorithm for the union-find problem\n\n## Disclaimer\nThe 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. \n\n## Original Plan\nI 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. \n![Original plan](https://cdn.honeybeeks.net/shQaf0poGA.jpg)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsebouellette%2Ffast-unionfind","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsebouellette%2Ffast-unionfind","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsebouellette%2Ffast-unionfind/lists"}