二叉树在Floyd算法最短路径存储中的应用

The Application of Binary Tree in Storage of the Shortest Path Realized by Floyd Algorithm

通过对存储网的邻接矩阵数据结构进行修改,实现了顶点对之间最短路径及其长度的存储.根据树的特性,顶点对之间最短路径的保存通过二叉树的方式实现,这为使用最短路径的后续操作提供了方便.

Through the modified network＇s adjacency matrix data structure, it realizes the storage of the shortest path and its length between the pair of vertexes. According to the characteristics of the tree, the preservation of the shortest path between the pair of vertexes is implemented by the binary tree, which provides convenience to the followup operation.