搜索资源列表
ConsultationDlg
- 最短路径搜索算法的应用。利用最短路径搜索作为校园地图导航-shortest path search algorithm applications. Use the shortest path search as a campus map navigation
Dijkstra_router
- Dijkstra最短路径算法，稍作修改亦可作为最短路由算法-Dijkstra shortest path algorithm, can be slightly amended as the shortest routing algorithm
RBFS_CODE
- RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！ -RBFS algorithm (recursive best first search : * A family) and the LRTA * algorithm (online local search, also known as real-time learning A * search, with t
20060511-171903
- 单源最短路径dijtsra算法的python实现-single source shortest path algorithm dijtsra achieve python
jintan
- 基于Mapx开发的最短路径Floyd算法程序的实现．-Mapx development based on the shortest path algorithm procedures Floyd realized.
Flody_ShortestPath
- 在VC++环境下,实现Flody最短路径算法的演示过程,操作方便,使用鼠标点击即可.-in VC environment, the realization of the shortest path algorithm Flody the demo process, convenient operation, use a mouse click away.
gongyuan
- 用图实现的公园导游图，包括最短路径，最优走法等的算法-map with the park guide map, including the shortest path, the optimal law to the algorithm
floyd
- 实现了图的单源最短路径的floyd算法，欢迎评价
克鲁斯卡尔
- 克鲁斯卡尔算法,求最短路径-Kelushikaer algorithm, for the shortest path
AStar
- 以A-star算法为基础的通过改良的最短路径探索的源代码
最短路径选择
- 实现了Dijkstra算法，解决最短路径问题。-achieve the Dijkstra algorithm, the shortest path to solve the problem.
zuiduanlujing
- 优化了之前的那个版本，最短路径用Dijkstra算法实现的MFC编程，这次是按实际的路径来将路画出来了。-That before the optimized version of Dijkstra shortest path algorithm using the MFC programming, this is the actual path to the road drawn out.
GoodPoint
- 使用佳点集遗传算法，解决安徽十七市的TSP问题，求出最短路径主要区别于普通遗传算法的地方是染色体交叉部分，另外编码方式使用十进制方式。-Good point set genetic algorithm used to solve TSP problem the city of Anhui, 17, find the shortest path to the main place is different from ordinary genetic algorithm is crossover s
Graphalgorithm
- 图论算法实现，含树，欧拉圈，霍夫曼编码，图的连通性，着色树，最短路径等，且采用加载皮肤界面，界面美观-Graph algorithms, including trees, Euler circles, Huffman coding, graph connectivity, coloring trees, shortest paths, and the interface with loads of skin, beautiful interface
TrafficCommand
- 建立交通网络图的存储结构 解决单源最短路径问题(Dijkstra算法) 实现两个城市之间的最短路径的问题 用MFC实现可视化菜单界面，使操作更加人性化，包括启动界面、图标、背景、按钮、界面框架等设计-Established transportation network graph structure to solve the storage problem of single-source shortest path (Dijkstra algorithm) to achieve t
Kruskal
- 最短路径算法 库鲁斯卡尔算法 数据结构算法实现-Shortest path algorithm
s2
- 邻接链表的建立、两种算法生成其最小生成树以及其显示、每一对顶点的最短路径-Adjacency list creation, two algorithms to generate the minimum spanning tree, and its display, the shortest path for each pair of vertices
Dijkstra
- Dijkstra算法(单源最短路径) 单源最短路径问题,即在图中求出给定顶点到其它任一顶点的最短路径。-Algorithm (single-source shortest path) Dijkstra,single-source shortest path problem, namely to obtain a given vertex to any other vertex of the shortest path in the graph.
AODVmin1234
- 在无线传感网络中，求解路由算法最短路径，节省传感节点的能量-Energy in wireless sensor networks, routing algorithm for solving the shortest path, saving sensor nodes
shortest-path
- 最短路径算法，通过本程序，能够清晰的明白算法的原理，并且程序能够很清楚的描述算法，对于想了解算法的人，也是非常不错的选择-Shortest path algorithm, through this program, can clearly understand algorithm principle, and the program can be very clear descr iption of the algorithm, for people who want to know the a