:vertical_traffic_light: Python's heap and priority queue library for JavaScript

:fallen_leaf: Heap data structures for JavaScript

Heapq library for Dosato

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.

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

Algorithms and Data Structures for Data Science and Machine Learning

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.

⚡ 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

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.

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.

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.

Dijkstra's Algorithm in Python

Visualization tool for various pathfinding algorithms and perfect maze generation.

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

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 new output file.

No description provided.

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.

TypeScript implementation of the CPython heapq module

Pop any value of the heap - not just the top element. Convenient feature for scheduling tasks.

This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

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 simple yet efficient representation of a social network graph with python | Data Structures and Algorithms Course Project, Spring 2021

This project implements an AI-powered last-mile delivery optimization system using Python. It leverages graph-based route optimization, demand prediction, and cost analysis to improve delivery efficiency in urban areas.