🚦 Python's heap and priority queue library for JavaScript
-
Updated
Jul 18, 2025 - JavaScript
#
heapq
Here are 37 public repositories matching this topic...
🍂 Heap data structures for JavaScript
javascript computer-science specifications data-structures agpl binary-heap heapsort binomial-heap heapq pairing-heap heaps fibonacci-heap brodal-queue rank-pairing-heap
-
Updated
Dec 1, 2023
Fast CPython extensions to Python standard library with focus on performance.
-
Updated
May 29, 2023 - C++
Algorithms and Data Structures for Data Science and Machine Learning
linked-list graph-algorithms random-forest data-structures binary-search-tree kmeans predictive-modeling boostrap knn decision-tree heapq dfs-algorithm doubly-linked-list kmeansplusplus bfs-algorithm bellman-ford-algorithm djikstra shortest-path-algorithm bagging-trees gini-index
-
Updated
Jun 7, 2021 - Jupyter Notebook
Heap queue algorithm implementation for Typescript based on heapq.py module from CPython
-
Updated
Feb 19, 2025 - TypeScript
⚡ A fast and lightweight priority queue implementation for JavaScript.
-
Updated
Jan 29, 2025 - TypeScript
Master's | Basic Algorithms & Data structures | Module 8 | Heaps or Pyramids
-
Updated
Jul 20, 2024 - Python
More stable and modern alternative to D's BinaryHeap, with small performance trade-offs.
-
Updated
Apr 14, 2025 - D
An extension to standard Python's heapq for high performance applications
python performance high-performance python3 cpython python-extension heapq performance-optimization cpython-extensions
-
Updated
Feb 13, 2020 - Python
Implementação da codificação de Huffman na compactação e descompactação de arquivos.
-
Updated
Jun 19, 2022 - C
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.
-
Updated
Jun 20, 2025 - Python
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.
-
Updated
Jan 29, 2018 - Python
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.
-
Updated
Jul 7, 2025 - Python
Multithread-priority-queue implementation.
-
Updated
Mar 2, 2024 - Python
Visualization tool for various pathfinding algorithms and perfect maze generation.
angular astar-algorithm pathfinding data-structures breadth-first-search heapq depth-first-search disjoint-sets dijkstra-algorithm uniform-cost-search prims-algorithm algorithm-visualisation aldous-broder recursive-backtracking-algorithm kruskal-maze-generator recursive-division
-
Updated
Apr 2, 2022 - TypeScript
This project implements a matching engine that efficiently pairs buyers and sellers based on price and quantity using heaps (priority queues).
-
Updated
Jul 21, 2023 - Python
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…
-
Updated
Nov 17, 2017 - Java
Improve this page
Add a description, image, and links to the heapq topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the heapq topic, visit your repo's landing page and select "manage topics."