Shortest PATHs with Multiplicative Cost. In a given undirected graph, the PATH cost is measured as a product of all the edges in the PATH. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest PATH between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the PATH.
標(biāo)簽：
Multiplicative
undirected
Shortest
measured
上傳時(shí)間：
2017-04-08
上傳用戶(hù)：邶刖
