Dijkstra with a Heap

You want the cheapest route from one node to every other node. Dijkstra solves this when every edge weight is zero or positive.

Dijkstra is greedy: it always expands the unvisited node with the smallest known distance, trusting that distance is final.