## Find maximum cost path in graph from given source to destination

Given a weighted graph, find the maximum cost path from given source to destination that is greater than a given integer x. The path should not contain any cycles. Get great deals at Amazon