搜索资源列表
work2z
- 图论算法库 C++ 语言实现 代码内容 图论算法库,包括以下算法: 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写,在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数,其调用接口见程
三四三
- 精确求出单源最短路径的好算法 可以变换源点的-calculated precision single source shortest path algorithm work in a good source! !
单源最短路径问题
- 单源最短路径问题-single source shortest path problem
exp10
- 采用邻接矩阵实现有向网的存储,建立有向网,并实现单源 最短路径算法-adjacency matrix used to achieve a storage network, to establish a network and to achieve single source shortest path algorithm
12-9
- 单源最短路径求解-single source shortest path Solution
分支限界法_单源最短路径
- 算法设计的分支限界法中的单源最短路径问题的实现,是用VC++编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
单源点最短路径贪心算法
- 单源点最短路径贪心算法:用到Dijkstra算法,-single source shortest path greedy algorithm : use Dijkstra algorithm,
货担郎问题
- 货担郎问题,求两点间最短路径。单源最短路径的求取。-goods, for the shortest path between two points. Single-source shortest path to the strike.
zuidatuan.rar
- 使用优先队列分支限界法对单源最短路径问题求解,最小堆作为优先队列的存储结构 使用最小堆来存储活结点,解空间树是一个子集树,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 heap storage structure to store s
duanyuanzuiduan.rar
- 单源最短路径问题,分支限界法的优先队列解法,最小堆来存储活结点表,表示活结点优先队列,优先级是结点所对应的当前路长,Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the
Dijkstra
- Dijkstra算法的研究对象是赋权有向图(图用加权矩阵表示)的单源最短路径问题。可以求出任意节点到其他所有节点的最短距离。-The research object is the Dijkstra algorithm of weighted directed graph ( graph with weighted matrix) of single source shortest path problem. Can be obtained any node to all other nodes
dandao
- 编写并调试一个单道处理系统的作业等待模拟程序。 作业等待算法:分别采用先来先服务(FCFS),最短作业优先(SJF)、响应比高者优先(HRN)的调度算法。 对每种调度算法都要求打印每个作业开始运行时刻、完成时刻、周转时间、带权周转时间,以及这组作业的平均周转时间及带权平均周转时间,以比较各种算法的优缺点。 -Write and debug a single-channel processing system operating to wait for simulation
Dijkstra
- Dijkstra算法设计单源最短路径问题的贪心算法-Greedy algorithm of Dijkstra algorithm design single source shortest path problem
spfa
- 求单源点最短路径效率最高的算法,包括2个样例程序和测试数据。-For single-source shortest path algorithm for the highest efficiency, including two sample procedures and test data.
greed
- 贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题-Greedy algorithm Collection, including two sub-coverage, single-source shortest path, topological sort, machine scheduling problem
Graph_Algorithm-1.0.tar
- 算法中图算法的详细实现,包括图的表示,MST,单源最短,所有最短路径算法的c++实现,在linux环境下面编程。-Algorithm in detail algorithm to achieve, including the map that, MST, single-source shortest, all the shortest path algorithm c realization of the following programming in linux environmen
ShortestPath
- 本程序实现了单源最短路径,很好用的。欢迎大家下载-This procedure achieved a single-source shortest path, a very good use. Welcome to the Download
traffic
- 通过对图的应用,建立一套交通网络图,实现对求单源最短路径,任意两个城市间的最短路径的查询. 首先根据邻接矩阵和图的知识建立交通网络图,顶点信息存储城市道路信息,由图的最短路径查询城市间的最短道路,输出到达路径。 -Through the diagram, the establishment of a transportation network map, to achieve for single-source shortest path between any two cities i
greedy
- 贪心法的算法,里面有最小生成树算法和单点源最短路径的算法,供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference
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