We are given a directed graph G=(V,E) on which each edge (u,v) has an associated value r(u,v) which is a real number in the range 0 (, ) 1 that represents the reliability of a communication channel from vertex u to vertex v. We interpret (, ) as the probability that the channel from u to v will not fail, and we assume that these probabilities are independent. Give an efficient algorithm to find the most reliable path between two given vertices.