This algorithm, implemented in C, explores hash structures and shortest path algorithms. It highlights the use of hashing for efficient data storage and retrieval, as well as the application of shortest path techniques in graph-based problems.

I developed the Dijkstra's Shortest Path Visualization as part of a university assignment. This project was a great opportunity to enhance my knowledge of Object-Oriented Programming (OOP). While there is potential for further improvements, I do not plan to continue its development at this time.

This repository contains a project implementing a Red-Black Tree and Dijkstra's algorithm to efficiently find the shortest paths in directed, weighted graphs. Developed as part of a course at POLIMI, the project features optimized data structures and algorithms for graph operations, achieving a grade of 30 cum laude / 30.