Dijkstra算法-最短路径问题+例题_dijkstra算法求解最短路径例题

Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.

背景
Hugo Heavy很高兴。
在Cargolifter项目破裂后，他现在可以扩展业务。
但他需要一个聪明的人告诉他，他的客户是否真的有办法将他的巨型钢制起重机建造到需要所有街道都能承受重量的地方。
幸运的是，他已经有了所有街道和桥梁以及所有允许重量的城市规划。不幸的是，他不知道如何找到最大重量能力，以告诉他的客户起重机有多重。
但你肯定知道。

Problem
You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered fr