heapq

🚦 Python's heap and priority queue library for JavaScript

🍂 Heap data structures for JavaScript

Algorithms and Data Structures for Data Science and Machine Learning

An extension to standard Python's heapq for high performance applications

Fast CPython extensions to Python standard library with focus on performance.

Given pseudocode of different heuristic search algorithms, designed a graphical user interface, a 50 eight neighbor benchmark grids map, to implement and evaluate their performances.

Pop any value of the heap - not just the top element. Convenient feature for scheduling tasks.

Heap queue algorithm implementation for Typescript based on heapq.py module from CPython

An array-based heap data structure with amortized const time insertion

Based on a set of temperatures, this program calculates the median temperature for every new temperature value. Implemented with PriorityQueues. One mode of program is interactive: provides user with command prompt to enter numeric values, then produces median for every new input. File mode reads values from file, then produces medians onto a new output file.

Sort large file sets by an input argument

Dijkstra's Algorithm in Python

upsert a db file by request files

row oriented to column oriented

Priority Job Scheduling using HeapQ

Simple heapqueue implementation in python with usable key function. Designed to remove the explicit use of tuples and key functions to get around this in the heapq implementation.