Description: 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.
To Search:
File list (Check if you may need any files):
回溯路由\floyd.m
........\getRoad.m
........\showGraph.m
........\test.m
减小复杂度\floyd.m
..........\showGraph.m
..........\test.m
前向路由\floyd.m
........\getRoad.m
........\showGraph.m
........\test.m
实验报告\25班-李俊-李雷-实验三.docx
回溯路由
减小复杂度
前向路由
实验报告
Download