{"id":16251576,"url":"https://github.com/pfalcon/beap","last_synced_at":"2025-03-19T20:30:58.704Z","repository":{"id":139748283,"uuid":"112828946","full_name":"pfalcon/beap","owner":"pfalcon","description":"Beap (bi-parental heap) algorithm reference implementation in Python ","archived":false,"fork":false,"pushed_at":"2018-01-20T14:29:21.000Z","size":12,"stargazers_count":13,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-17T10:38:18.268Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","data-structures","implicit","search-algorithm"],"latest_commit_sha":null,"homepage":"https://en.wikipedia.org/wiki/Beap","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/pfalcon.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-12-02T09:17:52.000Z","updated_at":"2023-03-24T06:16:05.000Z","dependencies_parsed_at":"2023-06-03T13:21:20.804Z","dependency_job_id":null,"html_url":"https://github.com/pfalcon/beap","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/pfalcon%2Fbeap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pfalcon%2Fbeap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pfalcon%2Fbeap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pfalcon%2Fbeap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pfalcon","download_url":"https://codeload.github.com/pfalcon/beap/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244501213,"owners_count":20462817,"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":["algorithms","algorithms-and-data-structures","data-structures","implicit","search-algorithm"],"created_at":"2024-10-10T15:10:39.418Z","updated_at":"2025-03-19T20:30:58.454Z","avatar_url":"https://github.com/pfalcon.png","language":"Python","readme":"Beap\n====\n\nBeap aka biparental heap (https://en.wikipedia.org/wiki/Beap) is an\n[implicit data structure][1] which allows efficient insertion and searching\nof elements, while not requiring any more space than the data elements\nthemselves. Efficient searching and insertion are supported by clever\narrangement of elements in the array which backs the beap structure,\nand clever algorithms utilizing this arrangement.\n\nBeap is further elaboration of the ideas of [heap][2] data structure\n(which allows for efficient insertion and finding minimum/maximum, but\nnot efficient searching for an arbitrary element). It was originally\n[described][3] by researchers Ian Munro and Hendra Suwanda. Howerver,\nit's quite hard to find an implementation of this data structure. Nor\nit's easy to implement it based on the original paper, because, following\na good academic tradition, the paper is rather terse, incomplete,\ninconsistent and has errata.\n\nThis project is an implementation of Beap using Python3, written by\nPaul Sokolovsky and distributed under the terms of OpenSource MIT license.\nIt's intended to be a reference implementation, i.e. written more for\nclarity and testability rather than optimized. It's accompanied by\ndetailed unit tests. The idea is that this implementation can serve\nas the basis for more efficient implementation, if such is needed.\n\nFor more information on implicit data structures, see\nhttps://github.com/pfalcon/awesome-implicit-data-structures .\n\n\n[1]: https://en.wikipedia.org/wiki/Implicit_data_structure\n[2]: https://en.wikipedia.org/wiki/Heap_(data_structure)\n[3]: http://www.sciencedirect.com/science/article/pii/0022000080900379\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpfalcon%2Fbeap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpfalcon%2Fbeap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpfalcon%2Fbeap/lists"}