搜索资源列表
BellmanFord
- Bellman-Ford算法 在图的应用中遇到负权,则可以采用Bellman-Ford算法来计算单源最短路径。-Bellman-Ford
suanfa
- 算法 单源最短路径实现方法 计算机上机实验 算法课程-Single-source shortest path algorithm is a computer-on Implementation of Experimental Algorithms Course
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be
ComputerTest
- 采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。-Adjacency matrix are used to achieve the network storage, establishing the network, and to achieve single-source shortest path algorithm.
PenQuestionAlgorithmSolution
- 一家GIS笔试题和解决方案1集装箱摆放问题2单源最短路径3区域生长-A GIS pen and the questions and solutions to a container placed in two single-source shortest path problem 3 Regional Growth
dijkstra_z
- 单源dijkstra邻接阵形式 单源最短路径,dijkstra算法,邻接阵形式,复杂度O(n^2)-Dijkstra adjacency matrix form of single-source single-source shortest path, dijkstra algorithm, adjacency matrix form, the complexity of O (n ^ 2)
dijkstra_b
- 单源最短路径,用于路权相等的情况,dijkstra优化为bfs,邻接表形式,复杂度O(m)-Single-source shortest path for the right of way case of a tie, dijkstra optimization bfs, adjacency list form, complexity of O (m)
Bellman-ford
- 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
dijkstra_mapped_heap
- 单源最短路径,dijkstra算法+映射二分堆,正向表形式,复杂度O(mlogn)-Single-source shortest path, dijkstra algorithm+ Mapping 2 points heap, positive list system, complexity of O (mlogn)
shortestpath
- 使用vc++实现数据结构中单源最短路径的实现,使用递归算法,比较简单-Using vc++ data structure, the realization of single-source shortest path, using a recursive algorithm, a relatively simple
Dijstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm used to calculate a node to all other nodes in the shortes
FZUGPS
- 基于单源最短路径dijkstra算法校园导航系统;-Campus Navigation System
work
- 汽车导引系统flash演示 采用单源最短路径算法 输入内容为车牌,学校入口就是起始点,目的地就是终点-Flash demo vehicle guidance system using single-source shortest path algorithm for the input plate, the school entrance is the starting point, the destination is the
dijkstra
- 采用贪婪法解单源最短路径的算法,采用了图的邻接表数据结构。-The minimum length of a graph using dijkstra.
Shortest_path
- 描述: 给定一个带权有向图 G=(V,E) ,其中每条边的权是一个整数。另外,还给定 V 中的一个顶点,称为源。现在我们要计算从源到所有其他各顶点的最短路径长度。这里的长度是指路上各边权之和。这个问题通常称为单源最短路径问题。 输入: 第一行为一个整数n,表示包含源在内的顶点的个数,接下来是一个n*n的矩阵,矩阵中-1表示此路不通,否则表示从该顶点到另一顶点的距离。例如对于上图所示的问题我们可以按输入样例
code
- 是关于单源最短路径的,他对于我们的学习很好,很有用,自己写的呀!-On single-source shortest path, and he' s learning very well for us, very useful, write to!
BBShortest
- 用分支限界法实现单源最短路径 用分支限界法的思想-Branch and bound method with single-source shortest path with the idea of branch and bound
DIJSTRA
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for computing a node to all other nodes of the shortest path.
Dijkstra
- dijkstra 单源最短路径不行算法 交流学习 -dijkstradijkstra 单源最短路径不行算法 交流学习