{"id":25422503,"url":"https://github.com/vextroyer/heap","last_synced_at":"2025-06-12T22:37:43.698Z","repository":{"id":223958888,"uuid":"760319544","full_name":"Vextroyer/Heap","owner":"Vextroyer","description":"Heap data structure implementation on several languages","archived":false,"fork":false,"pushed_at":"2024-02-22T23:34:26.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-13T20:35:58.135Z","etag":null,"topics":["data-structures","heap"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Vextroyer.png","metadata":{"files":{"readme":"Readme","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2024-02-20T07:41:55.000Z","updated_at":"2024-02-20T07:49:11.000Z","dependencies_parsed_at":"2024-02-23T00:32:14.894Z","dependency_job_id":"c29cc128-58a7-406f-8a08-5fbeded8f7a5","html_url":"https://github.com/Vextroyer/Heap","commit_stats":null,"previous_names":["vextroyer/heap"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vextroyer%2FHeap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vextroyer%2FHeap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vextroyer%2FHeap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vextroyer%2FHeap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vextroyer","download_url":"https://codeload.github.com/Vextroyer/Heap/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254021717,"owners_count":22000980,"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":["data-structures","heap"],"created_at":"2025-02-16T21:34:08.282Z","updated_at":"2025-05-13T20:36:38.279Z","avatar_url":"https://github.com/Vextroyer.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"On this repo there are implementations on several languages\nof the heap data structure.\n\nMaybe some algorithms using this structure will also e implemented on\nthe future, such as heapsort, and other structures such as the priority\nqueue.\n\nA heap is a binary tree who mantains several invariants:\n1- All the levels of the tree are complete except, perhaps, the last one.\n2- Insertions are done from left to right on the last uncomplete level, or in\na new level if all the previous levels are complete.\nDeletions works the same but from right to left.\n3- For all child nodes y from node x holds that x R y where R is an order relation.\nFor example x \u003c= y  (or x \u003e= y)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvextroyer%2Fheap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvextroyer%2Fheap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvextroyer%2Fheap/lists"}