beyzanc/shortest-path-finder-with-dijkstra

A basic C-based Dijkstra's algorithm application for finding shortest paths in city networks. Features user-specified input and min-heap for efficiency.

C