Consider a directed graph G $=($V$,$ E$)$ with n nodes and m edges which represents a

communication network where nodes are servers and edges are the communication links between them. Each edge is associated with a real number between $0$ and $1$ which represents the probability that the communication link will not fail. In other words if the number of edge e is le then a message sent on link e will be delivered with probability

le$.$

Assume that at one point a source node s needs to send out a message to a destination node v specifying which path in the network from s to u to use.

Which path should we choose if we want to maximize the probability that the message arrives at v$?$