文件名称:Floyd
介绍说明－－下载内容均来自于网络，请自行研究使用
Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。
程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.
程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
回溯路由\floyd.m
........\getRoad.m
........\showGraph.m
........\test.m
减小复杂度\floyd.m
..........\showGraph.m
..........\test.m
前向路由\floyd.m
........\getRoad.m
........\showGraph.m
........\test.m
实验报告\25班-李俊-李雷-实验三.docx
回溯路由
减小复杂度
前向路由
实验报告
........\getRoad.m
........\showGraph.m
........\test.m
减小复杂度\floyd.m
..........\showGraph.m
..........\test.m
前向路由\floyd.m
........\getRoad.m
........\showGraph.m
........\test.m
实验报告\25班-李俊-李雷-实验三.docx
回溯路由
减小复杂度
前向路由
实验报告