代码的功能：用弗洛伊德算法求每一对顶点之间的最短路径的c语言实现。弗洛伊德算法采用图的带权邻接矩阵存储结构。算法基本思想：假设求顶点Vi到Vj的最短路径。弗洛伊德算法依次找从Vi到Vj，中间经过结点序号不大于0的最短路径，不大于1的最短路径，直到中间顶点序号不大于n-1的最短路径，从中选取最小值，即为Vi到Vj的最短路径。-

Functionality of the code: Freud algorithm for each of the shortest path between vertices c language. Freud algorithm uses the graph weighted adjacency matrix storage structure. Algorithm The basic idea: Suppose demand vertex Vi to Vj the shortest path. Freud algorithm in order to find the shortest path from Vi to Vj, the middle after the serial number of the node is not greater than 0 and not more than one shortest path, until the middle vertex serial number is not greater than n-1 shortest path from select a minimum, Vi is the shortest path to Vj.









Functionality of the code: Freud algorithm for each of the shortest path between vertices c language. Freud algorithm uses the graph weighted adjacency matrix storage structure. Algorithm The basic idea: Suppose demand vertex Vi to Vj the shortest path. Freud algorithm in order to find the shortest path from Vi to Vj, the middle after the serial number of the node is not greater than 0 and not more than one shortest path, until t