输入图，输出最短路径。输入的图需要是 起点 距离 终点 格式-The program first read the input file to create node link list with name of nodes and count the number of nodes. Then it reread the input file to form the adjacency matrix of the graph. It has functions of creating, adding, deleting link list, as well as finding shortest path and printing result. It can point out if there is any disconnected graph form the source node and can print out an alternative shortest path of a node. However, the shortcoming of the program is that it can only point out one alternative shortest path　　　　of the nodes. If there are many shortest paths of a node, the program might not point out all of them.