Sorry about my English.
G=(V,E}, directed graph without cycles. every edge has a weight. Two vertexes: x and y.
Defenition: Bottleneck edge in path P is defined to be the edge with minimum weight in P.
Legal solution: simple path between x and y.
I have to find an algorithm which is a Maximum Legal solution with bottleneck in $O(|V|+|E|)$.
I tried to think about a formula - OPT (j,t) - which t is the bottleneck's edge until Edge j. but I stuck to prove it (because t has to change during the algorithm).
Any ideas? Thank u!