#heap #priority-queue #collection

leonardo-heap

Heap structure supporting fast in-place partial sorting

3 releases (breaking)

Uses old Rust 2015

0.3.0 May 27, 2018
0.2.0 May 4, 2016
0.1.0 Apr 30, 2016

#1946 in Data structures

MIT/Apache

35KB
756 lines

Leonardo Heap

Rust implementation of heap structure supporting fast in-place partial sorting,


lib.rs:

A binary heap structure supporting fast in-place partial sorting.

This is structure is the core of Dijkstra's Smoothsort algorithm.

No runtime deps