An algorithm problem

For a directed graph with positive weights, we dene the max-weight of a path from s to d as the maximum of the link weights along the path. Give an algorithm to compute the smallest max-weight paths from a source vertex s to all other vertices, and prove its correctness.

The algorithm should be a modication of Dijkstra's algorithm.