JAYPEE-MAP Data Structure Project implementing Dijkstra's algorithms for finding the shortest path in a graph using various data structures having different complexities.

This project is a C-based application designed to manage city data and find the shortest paths between cities. The program uses graph data structures to represent cities and their connections, ...

We compare multiple implementations of Dijkstra's single source shortest paths algorithm using two different data structures. The algorithms are implemented in Python programming language and the test ...