🚦 Python's heap and priority queue library for JavaScript
-
Updated
Aug 19, 2025 - JavaScript
🚦 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.
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.
Algorithms and Data Structures for Data Science and Machine Learning
⚡ A fast and lightweight priority queue implementation for JavaScript.
Advanced Python project on the design and analysis of algorithms. Includes practical modules on dynamic programming, graph theory, big data (Bloom filter, HyperLogLog), parallel computing (MapReduce), and optimization. Uses libraries like NumPy, Matplotlib, NetworkX, BTrees, PrettyTable, and Datasketch for efficient computation and visualization.
Heap queue algorithm implementation for Typescript based on heapq.py module from CPython
An extension to standard Python's heapq for high performance applications
Master's | Basic Algorithms & Data structures | Module 8 | Heaps or Pyramids
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.
A feature-rich Python CLI age calculator built as a small layered application
Multithread-priority-queue implementation.
A Python simulation of a smart elevator system using a Hill Climbing algorithm and heuristics to minimize passenger wait times. Visualized in real-time with Pygame.
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.
Implementation and comparison of graph search algorithms — Depth First Search (DFS) and A* Search — on a weighted graph to find paths from node A to G with total distance calculation.
Visualization tool for various pathfinding algorithms and perfect maze generation.
Add a description, image, and links to the heapq topic page so that developers can more easily learn about it.
To associate your repository with the heapq topic, visit your repo's landing page and select "manage topics."