dijistra最短路经算法的实现。根据以文件输入图中各个节点的距离关系，然后运用算法求出a点到b点的最短路径-dijistra realize the shortest path algorithm. According to the file input graph in each node the distance relationship, and then use algorithms to derive a point to b point shortest path