In some graphs, the shortest path is given by Optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
標(biāo)簽：
Optimizing
different
the
shortest
上傳時(shí)間：
2014-10-25
上傳用戶：1159797854
