搜索资源列表
ConsultationDlg
- 最短路径搜索算法的应用。利用最短路径搜索作为校园地图导航-shortest path search algorithm applications. Use the shortest path search as a campus map navigation
railway system
- 根据哈复曼编码原理制作的铁路最短路径查询体统-Minute Man coding theory produced the shortest path for the railway to decency
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
Mpath1
- 最短路径法 学习数据结构时本人用C++编写的，-shortest path method to study data structure, I am prepared with C,
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.
GONGCHEN
- C语言程序求最短路径问题,是无向图方面的. 数据结构中的图论-C language program for the shortest path problem, and there is no plan to the area. Data structure of the graph theory
lisan
- 一些离散数学的课程设计，是通过C++ Builder 编的！包括判断真值，求数组元素个数，和最短路径！-some discrete mathematics curriculum design, through the provision of C Builder! Including the true value judgment, for the array element number, and the shortest path!
nearestroad
- 本文提出一种VB+MO实现最短路径查的思路，具体代码请自己实现-VB MO achieve the shortest path investigation of thinking, their specific codes, please realize
short-road
- 对一个运输商来说要把货运到收货地点选择最短的路线运输是其实现最大利润的要求，那么怎样选择最短的运输路线呢？在运输交通图中，我们设每一个城市为一个结点（vertextype类型）点并把他们分别用关键字代表（关键字int key ），也就是说把每个城市给出一个整数编码；一个城市直接到另一个城市的交通路线为边且这两个城市为相邻结点，不妨设这条路线的距离为边的权值（权值int weight ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶
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
最短路径和最小生成树
- 最短路径和最小生成树-shortest path and minimum spanning tree
Bellman_ford
- bellman-ford的实现。可以输出每条最短路径经过的节点
邻接矩阵求最短路径
- 邻接矩阵的最短距离-adjacency matrix is the shortest distance
最短路径选择
- 实现了Dijkstra算法，解决最短路径问题。-achieve the Dijkstra algorithm, the shortest path to solve the problem.
最短路径法射线追踪的MATLAB实现
- 最短路径法射线追踪的MATLAB实现
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