{"id":22612248,"url":"https://github.com/ivanbgd/disjoint-sets-data-structure","last_synced_at":"2025-03-28T23:44:39.752Z","repository":{"id":139676977,"uuid":"110271733","full_name":"ivanbgd/Disjoint-Sets-Data-Structure","owner":"ivanbgd","description":"Efficient implementation of the Disjoint Sets data structure in Python","archived":false,"fork":false,"pushed_at":"2017-11-10T17:11:46.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-02-03T10:11:58.588Z","etag":null,"topics":["disjoint-set","disjoint-sets"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ivanbgd.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":"2017-11-10T17:04:10.000Z","updated_at":"2017-11-10T17:11:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"1eece045-e6de-4961-98ff-d147e602254b","html_url":"https://github.com/ivanbgd/Disjoint-Sets-Data-Structure","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/ivanbgd%2FDisjoint-Sets-Data-Structure","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FDisjoint-Sets-Data-Structure/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FDisjoint-Sets-Data-Structure/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivanbgd%2FDisjoint-Sets-Data-Structure/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ivanbgd","download_url":"https://codeload.github.com/ivanbgd/Disjoint-Sets-Data-Structure/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246117690,"owners_count":20726068,"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":["disjoint-set","disjoint-sets"],"created_at":"2024-12-08T17:11:35.850Z","updated_at":"2025-03-28T23:44:39.731Z","avatar_url":"https://github.com/ivanbgd.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Disjoint Sets Data Structure\n\nThis is an efficient implementation of the Disjoint Sets data structure, written in Python.\n\nUses Trees, Union by Rank Heuristic, and Path Compression Heuristic.\n\nUses 1-based indexing of arrays.\n\nWhen both union by rank heuristic and path compression heuristic are used, the average running time of each operation is nearly constant.\n\nThe code includes examples.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fdisjoint-sets-data-structure","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivanbgd%2Fdisjoint-sets-data-structure","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanbgd%2Fdisjoint-sets-data-structure/lists"}