利用MATLAB 实现Floyd 算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。 用MATLAB 仿真工具实现Floyd 算法：给定图G 及其边(i , j )的权

wi , j (1≤i≤n ,1≤j≤n) ，求出其各个端点之间的最小距离以及路由。

-Floyd achieved using MATLAB algorithms for the shortest distance routing adjacency matrix and distance matrix calculation map between any two points in the input matrix, and can query the shortest distance and route between any two points. Implemented in MATLAB simulation tools Floyd algorithm: G and its edge (i, j) of a given graph right wi, j (1 ≤ i ≤ n, 1 ≤ j ≤ n), find the minimum distance between the endpoints and each of its route.