🚦 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

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

⚡ A fast and lightweight priority queue implementation for JavaScript.

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

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

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

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.

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.

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.

Multithread-priority-queue implementation.

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

row oriented to column oriented

Dijkstra's Algorithm in Python

Visualization tool for various pathfinding algorithms and perfect maze generation.