Billalhossainshishir/emergency-route-planning ? reverse-engineered prompt

Build me a small C app that finds the cheapest route through a road network, like an emergency route planner. I want it to model roads as a weighted graph, use Dijkstra’s algorithm with a binary min heap, and then rebuild and print the final path from the start point to the destination.

Please include a simple command line program, clean graph and priority queue code, and good handling for bad input, missing locations, and unreachable destinations. I also want a solid test suite that checks the graph operations, heap behavior, shortest path results, route reconstruction, and edge cases. Make it easy to build and run with make, and keep the code organized and readable. If you need to look up any current C or testing details online, feel free to do that.