搜索资源列表
shorest
- dijistra最短路经算法的实现。根据以文件输入图中各个节点的距离关系，然后运用算法求出a点到b点的最短路径
Bellman_Ford
- Bellman_Ford 算法，求解带有负权重的边的单源点最短路径问题
spfa
- 求单源点最短路径效率最高的算法，包括2个样例程序和测试数据。-For single-source shortest path algorithm for the highest efficiency, including two sample procedures and test data.
ass2_088766_wangxiaofeng_325
- 最短路径算法 几个城市之间的距离 输出的是一个城市到另一个城市的距离-Shortest path algorithm in several cities the distance between the output of a city to another city in the distance
mazebestpath
- 迷宫最短路径问题，采用递归算法实现，C语言学习者的经典题目-Maze shortest path problem, the use of recursive algorithm
vc6.0shorttestpathsearch
- 货郎担最短路径生成 最短路径生成的算法不计其数 其中很多用回溯法 回溯法不错 不过很多新手写哦时候掌握不好效率 上传一个效率高的版本-Traveling Salesman generate the shortest path shortest path algorithm to generate many of which used numerous retrospective law retrospective laws, however good a lot of time to maste
God
- 用Windows控制台程序实现A*算法在交通网络中寻找最短路径的应用，并附有实际的测试数据，程序已经调过没有问题。-Windows Console Application with the realization of A* algorithm to find the shortest path transport network applications, along with the actual test data, the program has emphasized there is
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
dijiesiktra
- 按路径长度递增次序产生最短路径算法： 把V分成两组： （1）S：已求出最短路径的顶点的集合 （2）V-S=T：尚未确定最短路径的顶点集合 将T中顶点按最短路径递增的次序加入到S中， 保证：（1）从源点V0到S中各顶点的最短路径长度都不大于 从V0到T中任何顶点的最短路径长度 （2）每个顶点对应一个距离值 S中顶点：从V0到此顶点的最短路径长度 T中顶点：从V0到此顶点的只包括S中顶点作中间 顶点的最短路径长度 -
dijkstra
- 利用dijistra算法获取最短路径的控制台小程序，压缩包中含有设计报告。-Use dijistra algorithm to obtain the shortest path of the console applet package contains the design report.
Dijkstra
- 迪杰斯特拉算法，利用贪心算法实现两点间最短路径的求解-Dijkstra Algorithm
CPP-LYG-Journey
- 一个用C++写的课程设计，关于旅游的一个系统，用到了最短路径算法-A with C++ write curriculum design of a system on tourism, use the shortest path algorithm
AStar
- A星算法的C语言实现。生成随机地图，用A星算法搜索最短路径-A star algorithm in C language. Generates a random map A star algorithm to search for the shortest path
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
SPFA
- 一种高效的最短路径算法，适用于稀疏矩阵下的电影最短路径查找-An efficient shortest path algorithm suitable for sparse matrix movie shortest path lookup
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
kshortestpaths_2.1
- 一个k最短路径算法,用C++实现的，很好用-A k shortest path algorithm
exp_2
- 从文件读入一个有向正权图(n 个结点,m 条边)的权矩阵表示,输出这个图中某一结点到 其余各结点的最短路径长度。 程序必须使用 Dijkstra 算法,使用其他算法(比如穷举)不符合要求。-Reading from a file into a right to a positive figure (n nodes, m edges) of the weight matrix, said output this figure a junction to the length of the sh
ROADS
- 这是一道关于最短路径的算法问题，虽然问题简单但是其中的思想非常值得借鉴和学习，其中用到了优先队列和图的宽度搜索-This is a question about the shortest path algorithm, although the problem is simple, but the idea which is worth learning and learning, which uses the width of the search priority queue and ma