Hello @DanielFischer !!!
Could I ask you something about Dijkstra?
We have a directed graph G=(V,E), at which each edge $(u,v) \in E$ has a relative value $r(u, v) \in R$ and $ 0 \leq r(u,v) \leq 1$ that represents the reliability at a communication channel, from the vertex u to the vertex v. Consider as r(u, v) the probability that the channel from u to v will not fail the transfer and that the probabilities are independent.
I want to write an efficient algorithm the finds the most reliable path between two vertices, that are given.