You are given an undirected graph of n nodes. edges[i] = [a, b] is an edge that you cross successfully with probability succProb[i]. Return the largest probability of getting from start to end, where the probability of a path is the product of its edge probabilities, or 0 if there is no path.
- A
MinHeap class is provided: push([priority, ...payload]) and pop() return the entry with the smallest first element - Probabilities are between 0 and 1
- The answer is compared with a tolerance of 1e-9
start and end are different nodes