说明：  根据题目建立图的结构，利用 Dijiskara 算法依次计算出各点的最短路径。 要求 ： 图的结构为 { 0,1,1,1,0,0 , // 邻接矩阵表示图， 0 表示断路， 1 表示通路。 1,0, 0,0,1,0, 1,1,0, 0,0, 1,0, 0,1,0,0, 0,0,1, 1,1, 0,0,0,1,1,0,0,1, 0,1,0,0, 1, 0,0,0,0,1,1,1,1 }
(established under the title of the plan structures, the use of Dijiskara algorithm followed by calculating the shortest path to the point. Requirements : map the structure of the (0,1,1,1,0,0,0,0,// adjacency matrices map 0 indicates that the traffic, said a pathway. 1,0,1,0,0,0,1,0, 1,1,0,1,1,0,0,0, 1,0,1. 0,0,1,0,0, 0,0,1,0,0,1,1,1, 0,0,0,1,1,0. 0,1, 0,1,0,0,1,0,0,1, 0,0,0,0,1,1,1,1))