程序是使用类实现迪杰斯特拉算法计算图的最短路径问题。但是图的结点数默认为6，可自行修改。-Program is to achieve the shortest path problem using Dijkstra algorithm class diagram. However, the default is the number of nodes in Figure 6, you can modify.