{"id":18763552,"url":"https://github.com/lukaspietzschmann/binomial-tree","last_synced_at":"2025-12-06T03:30:10.776Z","repository":{"id":124211204,"uuid":"224876600","full_name":"LukasPietzschmann/Binomial-Tree","owner":"LukasPietzschmann","description":"An implementation of a binomail Heap in Java","archived":false,"fork":false,"pushed_at":"2020-06-03T09:12:20.000Z","size":125,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-15T13:38:47.383Z","etag":null,"topics":["binomial-heap","binomial-tree","java"],"latest_commit_sha":null,"homepage":"","language":"Java","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/LukasPietzschmann.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":"2019-11-29T15:13:36.000Z","updated_at":"2020-12-14T14:11:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"86b2fadf-313e-4664-8f43-e89e63f7f20c","html_url":"https://github.com/LukasPietzschmann/Binomial-Tree","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/LukasPietzschmann%2FBinomial-Tree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LukasPietzschmann%2FBinomial-Tree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LukasPietzschmann%2FBinomial-Tree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LukasPietzschmann%2FBinomial-Tree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LukasPietzschmann","download_url":"https://codeload.github.com/LukasPietzschmann/Binomial-Tree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239661824,"owners_count":19676411,"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":["binomial-heap","binomial-tree","java"],"created_at":"2024-11-07T18:26:35.221Z","updated_at":"2025-12-06T03:30:10.677Z","avatar_url":"https://github.com/LukasPietzschmann.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binomial-Tree\nThis is a priority queue implemented with a binomial-Heap.\n\nIt implements support for\n* inserting an Entry with an associated Priority\n* removing a specific Entry\n* finding and removing the Entry with a minimal Priority\n* changing the Priority of a specific Entry\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flukaspietzschmann%2Fbinomial-tree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flukaspietzschmann%2Fbinomial-tree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flukaspietzschmann%2Fbinomial-tree/lists"}