\\程序\\sj\\统计度、出度、入度、出权、入权、边权、点权分布程序\\sj\\计算最短路径和聚类系数2

Dijkstra算法求单源最短路径 输入结点数关系数然后输入结点和其间的关及系权值，得出最短路径-Dijkstra algorithm for single-source shortest path relationship between the number of input nodes and then enter the node and which the Department of Customs and the right value, the shortest path ob