搜索资源列表
zuiduanlujing
- 说明：这是个在公园里各景点之间最短路径的控制台程序。非常好，使用dijkstra,floyd算法-Note: This is the various attractions in the park where the shortest path between the console program. Very good, using dijkstra, floyd algorithm
Floyd
- 图的一个最短路径，用的Floyd实现，好型挺好用的-A shortest path in the graph, with the Floyd achieved, the good type good use aaaaaaaaa
Floyd0
- 用Floyd实现图中最短路径的查找，可以重复使用，循环嵌套，实用的小程序-Floyd to achieve the shortest path to the search, can be reused, nested loop, and practical small procedures
FloydW
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
Floyd
- 利用Floyd算法求各个点到各个点的最短路径，在控制台窗口中输出路径及距离，算法较经典，VC++实现-Floyd algorithm for the various points to various points of the shortest path, output path and distance algorithm in the console window classic VC++ is to achieve
Floyd
- 用弗洛伊德算法实现最短路径的求解，用到的抽象数据类型为邻接矩阵类型和有向图类型类型-Floyd algorithm to achieve the shortest path to solve abstract data types used in the adjacency matrix type and have the type of diagram types
Floyd
- 这是算法课的作业，读取文件中的距离矩阵，计算最短路径-This is the algorithm class job, read the file in the distance matrix to calculate the shortest path
market_selected
- 学生的数据结构课设-超市选址问题，利用了弗洛伊德算法。-Student data structures course set- Supermarket location problem, use the Floyd algorithm.
Floyd
- Floyd算法实现地图最短路径，包含简单的动画-Floyd shortest path algorithm maps contain simple animation