🚦 Python's heap and priority queue library for JavaScript

🍂 Heap data structures for JavaScript

Algorithms and Data Structures for Data Science and Machine Learning

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

⚡ A fast and lightweight priority queue implementation for JavaScript.

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

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

Heapq library for Dosato

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

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

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.

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

Multithread-priority-queue implementation.

This project is a team assignment for the "Multimedia Systems" course, offered in the 6th semester of the 2023 academic year at the University of Piraeus, Department of Informatics.

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…

Visualization tool for various pathfinding algorithms and perfect maze generation.

Text Summarization is a very useful technique to get important parts of a large text document. This project uses word frequencies of the sentence and yield a score for each sentence.

A desktop app with GUI to find the shortest path between selected points on a map using tkinter, numpy, cv2, heapq, numba, and PIL

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