搜索资源列表
Graph
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.
DIJKSTR
- 用贪心法解单源最短路径,比较不错的一个算法,大家好好看下-Greedy method using single-source shortest path solution, compare a good algorithm, a good U.S. facie
ouyang6
- 求单源最短路径(要求用Dijkstra算法求得）-For single-source shortest path (Dijkstra algorithm requires obtained)
Graph-Theory
- 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0
greed
- 贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题-Greedy algorithm Collection, including two sub-coverage, single-source shortest path, topological sort, machine scheduling problem
shortest-way-java
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件-Branch and bound method single-source shortest path problem JAVA realization of 3 source files
ShortestPath
- 本程序实现了单源最短路径，很好用的。欢迎大家下载-This procedure achieved a single-source shortest path, a very good use. Welcome to the Download
zuidatuan
- 使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构 使用最小堆来存储活结点，解空间树是一个子集树-Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest he
shortestpaths
- 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
floyed
- Floyed求全局单源最短路径算法，用C++语言实现。-Floyed for the overall single-source shortest path algorithm, using C++ Language.
11
- 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest
shortestpathalgorithm
- 单源最短路径的算法，用vc++写的程序，能计算从一点到其余各点的距离 -Single-source shortest path algorithm, using vc++ to write the procedures, can be calculated from the point to the distance between the remaining points
Dijkstra
- Dijkstra算法--c++源代码 单源最短路径问题，或者称为最短路径问题，是要确定从s到V中没一个其他 顶点的距离，这里从顶点s到x的距离定义为从s到x的最短路径问题。-Dijkstra algorithm- c++ source code for single-source shortest path problem, or known as the shortest path problem is to determi
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, th
Shortest_Path
- 一个求单源最短路径的算法，即Dijkstra算法-One for single-source shortest path algorithm, Dijkstra algorithm that
Dijkstra
- Dijkstra算法 实现Dijkstra算法。 要求：对有向网络用Dijkstra算法求出单源最短路径。 -Dijkstra algorithm Dijkstra algorithm. Requirements: on the network using Dijkstra algorithm to find single-source shortest path.
dijkstra
- 计算最短路径，根据单源最短路径算法中的Dijkstra‘s算法-computer Dijkstra s shortest path
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
Dijkstra
- Dijkstra算法求单源最短路径 输入结点数关系数然后输入结点和其间的关及系权值，得出最短路径-Dijkstra algorithm for single-source shortest path relationship between the number of input nodes and then enter the node and which the Department of Customs and the rig
Mapofsingle-sourceshortestpath
- 图中的单源最短路径，给出图中的一个目的结点，求出其它各点到它的最短距离-Map of single-source shortest path