# Shortest path in graph

I have an undirected graph, where the value of the path is the maximum weight among all weights edges included in it. And I want find the shortest path (by value) for two any given vertices in $$O(n + m)$$, where $$n$$ – number of vertices, $$m$$ – number of edges.