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

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

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.

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

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.

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.

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.

A desktop app with GUI to find the shortest path between selected points on a map using tkinter, numpy, cv2, heapq, numba, and PIL

Priority Job Scheduling using HeapQ

Simple heapqueue implementation in python with usable key function. Designed to remove the explicit use of tuples and key functions to get around this in the heapq implementation.

Sort large file sets by an input argument

upsert a db file by request files

Let's go DeepDiving 🤿

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

row oriented to column oriented