🚦 Python's heap and priority queue library for JavaScript

🍂 Heap data structures for JavaScript

⚡ A fast and lightweight priority queue implementation 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

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

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

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

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.

Multithread-priority-queue implementation.

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.

row oriented to column oriented

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 implements a matching engine that efficiently pairs buyers and sellers based on price and quantity using heaps (priority queues).

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.

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.