Given a directed graph with weight between 0 and 1. How can I find the path that maximizes the product of weight?
Want:
path, prob = maximum_likelihood
