搜索资源列表
Dijkstra
- C++实现求单源最短路径,可以由用户自己构造有向无环图-C++, find single-source shortest path can be constructed by the users themselves have directed acyclic graph
theshortestpath
- 用分支限界搜索法求解单源最短路径问题的算法-Branch and bound search method with a single-source shortest path algorithm
ShortestPath
- 本程序是使用动态规划算法来解决单源最短路径问题。使用时,先输入每个头结点的邻接顶点个数,然后输入每个邻接顶点的数据。-This procedure is to use the dynamic programming algorithm to solve the single-source shortest path problem. When used, enter each of the first number of vertice
tanxinfadanyuanzuidaunlujing
- 实现贪心法单源最短路径 绝对正确 算法设计与分析中贪心法的应用 环境为VC6.0-failed to translate
zuiduanlujing
- 单源最短路径,单目标最短路径,单顶点对最短路径间等算法-Single-source shortest path, single target shortest path between one vertex on the shortest path algorithms such as
New-Text-Document-(2)
- 用Dijkstra算法求单源最短路径 输入参量ma是距离矩阵 输出参量是一个三行n列矩阵,每列表示顶点号及顶点到源的最短距离和前顶点-With a single-source Dijkstra shortest path algorithm for getting the input parameter ma is the output parameter from the matrix is a matrix of three
Single-source-shortest-path
- 在vc6.0环境下,实现单源最短路径的迪杰斯特拉的完整算法-In vc6.0 environment, single-source shortest path algorithm Dijkstra complete
Europe-by-Rail
- 有关数据结构中的图的单源最短路径问题,以欧洲铁路图为原型-Map the data structure of single source shortest path problem, The picture shows the prototype of the European railway
P2P_Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法的Dial实现是通过一系列方法,对Dijkstra算法进行加速。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm to compute a no
Dijkstra
- 设在图G={V,E}中有一顶点r,Dijkstra算法可以求出其他所有点到点r的最短路径的跳数,这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the ho
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,
shortest-path
- 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
shortpath
- 有向图单源最短路径,由随机函数产生边权,源顶点可以自己指定。-A single-source shortest path to the graph, the right side by a random function generator, source vertex can specify your own.
Dijkstra
- Dijkstra算法实现单源最短路径的查找。-Single-source Dijkstra algorithm to find the shortest path.
ExtMGraph
- 求飞机最少换乘次数。(单源最短路径问题) 由用户输入城市数目和城市之间的航线,以及源点,程序输出路径。-Find the aircraft at least transfer times. (Single source shortest path problem) from the user input the number of cities and routes between cities, as well as the so
Dijkstra
- 可以直接编译运行,输入点和边的信息,给出单源最短路径的结果。-Can directly compile and run, input points and edges information, presented the results of single-source shortest path.
dijkstra
- 单源最短路径,MATLAB编程,用于数学建模。-Monophyletic shortest paths, MATLAB, used for mathematical modeling.
c
- 在图论中经常会遇到这样的问题,在一个有向图里,求出任意两个节点之间的最短距离。我们在离散数学、数据结构课上都遇到过这个问题,在计算机网络里介绍网络层的时候好像也遇到过这个问题,记不请了... 但是书本上一律采取的是Dijkstra算法,通过Dijkstra算法可以求出单源最短路径,然后逐个节点利用D -single source shortest path problem of dynamic programming algorit
Test_ShortPath
- 贝尔曼福特 和 迪杰斯特拉 单源最短路径算法的实现-single source shortest path algorithm,Bellman Ford and Dijkstra
Single-source-shortest-path
- 单源最短路径的求解,摘自百度! 希望对大家有帮助!-Single-source shortest path