搜索资源列表
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
导游图
- 用c语言实现的导游图，有图形界面，支持鼠标操作，使用dfs和floyd算法实现给出两点间最短路和最长路。-used language guides map, a graphical interface, mouse support operation, use dfs and Floyd algorithm is the shortest path between two points and the longest path.
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
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 ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶
最短路径和最小生成树
- 最短路径和最小生成树-shortest path and minimum spanning tree
dijkstra
- calculates the shortest path and distance between two nodes on a map
dfwwdf
- 二叉树最短路径问题-binary tree shortest path problem
克鲁斯卡尔
- 克鲁斯卡尔算法,求最短路径-Kelushikaer algorithm, for the shortest path