🚦 Python's heap and priority queue library for JavaScript

🍂 Heap data structures for JavaScript

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

Heapq library for Dosato

Algorithms and Data Structures for Data Science and Machine Learning

⚡ A fast and lightweight priority queue implementation for JavaScript.

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

More stable and modern alternative to D's BinaryHeap, with small performance trade-offs.

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

Master's | Basic Algorithms & Data structures | Module 8 | Heaps or Pyramids

Implementação da codificação de Huffman na compactação e descompactação de arquivos.

A Python project focused on fundamental knowledge of algorithms and data structures. This repository provides clear implementations and explanations to help understand core algorithmic concepts.

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.

Multithread-priority-queue implementation.

Code and analysis for building a search engine to retrieve and rank master's degrees. Implements data collection, preprocessing, inverted indexing, conjunctive queries, custom scoring, and map visualization.

This project implements a matching engine that efficiently pairs buyers and sellers based on price and quantity using heaps (priority queues).

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 ne…

Dijkstra's Algorithm in Python

Visualization tool for various pathfinding algorithms and perfect maze generation.