We are given a graph G = (V, E) where V represents a set of locations and E represents a communications channel between two points. We are also given locations s, t V , and a reliability function r : V V [0, 1]. You need to give an efficient algorithm which will output the reliability of the most reliable path from s to t in G.

For any points u, v V , r(u, v) is the probability that the communication link (u, v) will not fail: 0 r(u, v) 1. Note that if there is a path with two edges, for example, from u to v to w, then the reliability of that path is r(u, v) r(v, w).

For this problem, you modify Edge Relaxation. Just show your modified version of the Edge Relaxation operation or function; do not provide anything else (e.g., pseudocodes of your entire algorithm). [6 points]