Leetcode 1514. Path with Maximum Probability

Find the path from start to end in an undirected graph that maximizes the product of edge success probabilities (return 0 if unreachable). This is a max-product shortest-path problem on a weighted graph and can be solved by converting multiplicative weights to additive (e.g., negative logs) or directly using a Dijkstra-like propagation of maximum probabilities.