backtracking/bheap

OCaml binary heap implementation by Jean-Christophe Filliatre

18

stars

7

commits

OCaml

primary language

Nov 29, 2020

updated

README

bheap

Traditional implementation of priority queues using a binary heap encoded in a resizable array.

Contributors

7 commits

Similar repos

backtracking/vector

16

pqwy/psq

Functional Priority Search Queues for OCaml

53

luciopaiva/heapify

The fastest JavaScript priority queue out there. Zero dependencies.

743

mourner/tinyqueue

The smallest and simplest priority queue in JavaScript.

468

mourner/flatqueue

A very fast and simple JavaScript priority queue

144

lemire/FastPriorityQueue.js

a fast heap-based priority queue in JavaScript

364

lemire/StablePriorityQueue.js

A stable heap-based priority queue in JavaScript

31

ocaml/ocamlfind

The OCaml findlib library manager

47

Languages

OCaml

99.1%

backtracking/bheap

OCaml binary heap implementation by Jean-Christophe Filliatre

18

stars

7

commits

OCaml

primary language

Nov 29, 2020

updated

README

bheap

Traditional implementation of priority queues using a binary heap encoded in a resizable array.

Similar repos

backtracking/vector

16

pqwy/psq

Functional Priority Search Queues for OCaml

53

luciopaiva/heapify

The fastest JavaScript priority queue out there. Zero dependencies.

743

mourner/tinyqueue

The smallest and simplest priority queue in JavaScript.

468

mourner/flatqueue

A very fast and simple JavaScript priority queue

144

lemire/FastPriorityQueue.js

a fast heap-based priority queue in JavaScript

364

lemire/StablePriorityQueue.js

A stable heap-based priority queue in JavaScript

31

ocaml/ocamlfind

The OCaml findlib library manager

47

Contributors

7 commits

Languages

OCaml

99.1%