{"id":20345218,"url":"https://github.com/heap-data-structure/about","last_synced_at":"2025-12-12T03:10:38.199Z","repository":{"id":32717071,"uuid":"36306784","full_name":"heap-data-structure/about","owner":"heap-data-structure","description":":fallen_leaf: Heap data structures for JavaScript","archived":false,"fork":false,"pushed_at":"2023-12-01T14:45:19.000Z","size":1992,"stargazers_count":3,"open_issues_count":9,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-10T02:43:03.808Z","etag":null,"topics":["agpl","binary-heap","binomial-heap","brodal-queue","computer-science","data-structures","fibonacci-heap","heapq","heaps","heapsort","javascript","pairing-heap","rank-pairing-heap","specifications"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/heap-data-structure.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}},"created_at":"2015-05-26T15:51:35.000Z","updated_at":"2021-12-21T15:07:56.000Z","dependencies_parsed_at":"2022-08-22T23:10:30.808Z","dependency_job_id":null,"html_url":"https://github.com/heap-data-structure/about","commit_stats":null,"previous_names":["aureooms/js-heap"],"tags_count":35,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heap-data-structure%2Fabout","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heap-data-structure%2Fabout/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heap-data-structure%2Fabout/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heap-data-structure%2Fabout/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/heap-data-structure","download_url":"https://codeload.github.com/heap-data-structure/about/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241876123,"owners_count":20035382,"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":["agpl","binary-heap","binomial-heap","brodal-queue","computer-science","data-structures","fibonacci-heap","heapq","heaps","heapsort","javascript","pairing-heap","rank-pairing-heap","specifications"],"created_at":"2024-11-14T22:07:18.947Z","updated_at":"2025-12-12T03:10:33.144Z","avatar_url":"https://github.com/heap-data-structure.png","language":null,"readme":":fallen_leaf: [Heaps](https://make-github-pseudonymous-again.github.io/js-heap)\n[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-heap.svg?style=flat)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-heap/main/LICENSE)\n[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-heap.svg?style=flat)](https://github.com/make-github-pseudonymous-again/js-heap/issues)\n==\n\n\u003cp align=\"center\"\u003e\n\u003ca href=\"https://xkcd.com/835\"\u003e\n\u003cimg src=\"https://imgs.xkcd.com/comics/tree.png\" width=\"600\"\u003e\n\u003c/a\u003e\u003cbr/\u003e\n© \u003ca href=\"https://xkcd.com\"\u003exkcd.com\u003c/a\u003e\n\u003c/p\u003e\n\nHeap data structures and algorithms in JavaScript.\nParents are\n[js-data-structures](https://github.com/make-github-pseudonymous-again/js-data-structures)\nand\n[js-algorithms](https://github.com/make-github-pseudonymous-again/js-algorithms).\n\n## :baby: Children\n\nThis README regroups projects implementing heap data\nstructures and algorithms in JavaScript.\nThis repository does not contain any code.\n\n### :herb: Data Structures\n\n#### Classical\n\n  - [x] [@heap-data-structure/d-ary-heap](https://github.com/heap-data-structure/d-ary-heap): d-ary heap data structure for JavaScript\n  - [x] [@heap-data-structure/binomial-heap](https://github.com/heap-data-structure/binomial-heap): Binomial heap data structure for JavaScript\n  - [x] [@heap-data-structure/pairing-heap](https://github.com/heap-data-structure/pairing-heap): Pairing heap data structure for JavaScript\n  - [x] [@heap-data-structure/fibonacci-heap](https://github.com/heap-data-structure/fibonacci-heap): Fibonacci heap data structure for JavaScript\n\n#### Variants\n\n  - [ ] [Leftist tree](https://en.wikipedia.org/wiki/Leftist_tree)\n  - [ ] [Skew heap](https://en.wikipedia.org/wiki/Skew_heap)\n  - [ ] [Weak heap](https://en.wikipedia.org/wiki/Weak_heap)\n  - [ ] [Rank-pairing heap](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.153.4644\u0026rep=rep1\u0026type=pdf)\n\n#### Advanced\n\n  - [ ] [Leonardo heap](https://www.keithschwarz.com/smoothsort)\n  - [ ] [Brodal queue](https://en.wikipedia.org/wiki/Brodal_queue)\n  - [ ] [Strict Fibonacci heap](https://en.wikipedia.org/wiki/Fibonacci_heap)\n  - [ ] [2-3 heap](https://en.wikipedia.org/wiki/2-3_heap)\n\n\n### :signal_strength: Sorting Algorithms\n\n  - [x] [@comparison-sorting/heap-sort](https://github.com/comparison-sorting/heap-sort): Heap sort algorithm for Javascript\n\n\n### :microscope: Testing\n\n  - [x] [@heap-data-structure/specification](https://github.com/heap-data-structure/specification): Specification for heap data structures in JavaScript\n\n\n### :unicorn: Other\n\n  - [x] [@data-structure/heapq](https://github.com/data-structures-and-algorithms/heapq): Python's heapq library for Javascript\n\n\n## :scroll: Reference\n\n  - http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf\n  - http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps\n  - https://en.wikipedia.org/wiki/Introduction_to_Algorithms\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fheap-data-structure%2Fabout","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fheap-data-structure%2Fabout","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fheap-data-structure%2Fabout/lists"}