搜索资源列表
spfa
- 求单源点最短路径效率最高的算法，包括2个样例程序和测试数据。-For single-source shortest path algorithm for the highest efficiency, including two sample procedures and test data.
Dijkstra
- 1 将顶点集V分成 S(开始只包含源点, S包含的点都是已经计算出最短路径的点) 和 V-S 集合(V-S 包含那些未确定最短路径的点) 2. 从V-S中选取这样一个顶点w: 满足经过S集合中任意顶点 v到w 的路径最短, 即 满足( 源到v的路径 + v到w的路径) 最小的那个w. 其中v 属于S, w属于S-V。将w 加入S, 并从V-S中移除w. 3. 如此反复，直到V-S变空集为止-1 to the vertex set V into S (the beginni
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
migong
- 迷宫问题，程序根据用户选择的大小生成一个随机迷宫，由用户输入两组坐标分别作为迷宫的出口和入口，程序计算从出口到入口的所有路径，找到最短和最长路径并输出路径信息。-Maze problem, according to the user to select the size of the program generates a random maze, two sets of coordinates were entered by the user as the entrance and exit
DIJandFloyd
- 输入一个邻接矩阵，求一个图的最短路径，2种方法：迪杰斯特拉发和弗洛伊德法-Enter an adjacency matrix, the shortest path of a graph, two kinds of methods: Dijkstra hair and Freud Act
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
The-maze-problem
- C++源码，控制台实现数据结构中的迷宫问题，可给出所有路径的路径图，路径总数和最短路径图-Using VC++ to realize the maze problem.It can figure out all paths and the shortest path.