搜索资源列表
zdlj
- 最短路径问题（包括Floyd算法和避圈法）的matlab程序，较实用-Shortest path problems (including Floyd algorithm and avoid the circle method) matlab procedures, more practical
matlab_bgl-2.1
- 图论必用，有关图论的求最短路径，遍历等的各种函数。-Graph theory will be used, the graph theory for the shortest path, traverse a variety of functions, etc..
yiqun
- 蚁群算法，基于蚁群算法的最短路径问题，编译环境为c-Ant algorithm, ant colony algorithm based on the shortest path problem, the compiler environment for c++
Dijkstra
- 用弗洛伊德算法和狄克斯特拉算法实现求最短路径-Algorithm and狄克斯特拉with Freud for the shortest path algorithm
Dijkstra_MapX_VB
- VB+MapX实现Dijkstra算法，通过输入起始点坐标可以得到两点间的最短路径-Implement the Dijkstra algorithm By Visual Basic And MapX5.0
Floyd
- FLOYD求图中的任意两点之间的最短路径。使用了标准算法。-caculate the shortest path of two points in a grap
JAVA
- 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel routes, Dijkstra s algorithm
Real-World_Application_Routing_Problem(Book)
- 遗传算法在最短路径问题（shortest path routing problem）中的实际应用-Real-World Application：Routing Problem(Book)
Module1
- VB编程MO最短路径编程学习资料，质量高-Programming VB Programming mo study the shortest path information and high quality
aa
- 蚁群算法 适合寻找最优问题，实现最短路径。-Ant colony algorithm for finding the optimal problem, the realization of the shortest path.
YTUmap_
- 基于MFC（对话框），采用两种方法实现了最短路径！-Based on MFC (dialog), using two methods to achieve the shortest path!
Floyd
- Floyd算法，应用于求最短路径的问题，已知数的网状结构，求两点的最短路径-Floyd algorithm, used for the shortest path problem,已知数the network structure, and two of the shortest path
MazeGame
- 程序开始运行时显示一个迷宫地图，迷宫中央有一只老鼠，迷宫的右下方有一个粮仓。游戏的任务是使用键盘上的方向键操纵老鼠在规定的时间内走到粮仓处。要求：1）老鼠形象可辨认，可用键盘操纵老鼠上下左右移动；2）迷宫的墙足够结实，老鼠不能穿墙而过；3）正确检测结果，若老鼠在规定时间内走到粮仓处，提示成功，否则提示失败；4）添加编辑迷宫功能，可修改当前迷宫，修改内容：墙变路、路变墙；5）找出走出迷宫的所有路径，以及最短路径。利用序列化功能实现迷宫地图文件的存盘和读出等功能-The beginning of t
airport
- 模拟airport，添加航班，去除航班，算出最短路径 -Simulated airport, add flights to remove flights to calculate the shortest path, etc.
AStarShotDistance
- 这是利用.net来实现的A*最短路径算法，其实现由人机进行交互进行设置，不失为一个最小路径的好方法-This is use. Net to achieve the A* shortest path algorithm, the realization of human-computer interaction by setting, is a good way to minimize the path
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
Dijkstra
- matlab编写的，用于人工智能中最短路径搜索，迪接斯卡拉算法-Dijkstra
floyd
- floyd算最短路径，函数和例子都有。只需要把数据转换就行-floyd
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
vb-Mapinfo-zuiduanlujin
- vb,Mapinfo,最短路径。调试通过。值得学习。-vb, Mapinfo, the shortest path. Debugging through. Worth learning.