Modified Dijkstra's Algorithm
<p>We are given a directed graph with edge weights W lying between 0 and 1. Cost of a path from source to target node is the product of the weights of edges lying on the path from source to target node. I wanted to know of an algorithm which can find the minimum cost path in polynomial time or using any other heuristic.</p>

<p>I thought along the lines of taking the log values of the edges weights (taking mod values) and then applying dijkstra for this graph but think there will be  precision problems which can't be calculated.</p>

<p>Is there any other better way or can I improve upon the log approach.</p>