🚦 Python's heap and priority queue library for JavaScript

🍂 Heap data structures for JavaScript

Algorithms and Data Structures for Data Science and Machine Learning

Fast CPython extensions to Python standard library with focus on performance.

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

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

Multithread-priority-queue implementation.

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.

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

Implementação da codificação de Huffman na compactação e descompactação de arquivos.

A simple yet efficient representation of a social network graph with python | Data Structures and Algorithms Course Project, Spring 2021

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…

Visualization tool for various pathfinding algorithms and perfect maze generation.

An array-based heap data structure with amortized const time insertion

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.

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.

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 desktop app with GUI to find the shortest path between selected points on a map using tkinter, numpy, cv2, heapq, numba, and PIL

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.