Dijkstra's algorithm produces correct shortest paths only when all edge weights are: