This repository contains a basic C program that calculates the shortest path between two cities in a map, using adjacency matrices and minimum heaps. The program reads from an input file to construct ...

In this project I used Dijkstra’s Algorithm to find the shortest path in a weighted graph. We take an adjacency matrix as input, asks the user for a starting and ending node, and then step by step the ...