对所给出的城市路口、道路信息，分别用Dijkstra 算法和Floyd算法，求出两两之间的最短距离和路径，结果输出到文件，每行一组最短路径，其格式为逗号分割的信息，分别为起点、终点、最短距离、中间依次经过的路口编号，各行按照起点编号、终点编号从小到大排序，只输出起点编号小于终点编号的部分。

-Information given city intersection, road, Dijkstra algorithm and Floyd algorithm to calculate the shortest distance and path between every two, the resulting output to a file, each line of a shortest path, its format is a comma-separatedas a starting point, the end of the shortest distance, the middle turn through the intersection number, each line in accordance with the starting point number, end number from small to large sorting and output only part of the starting point number is less than the end number.