Search - ford bellman

Search - ford bellman - List

[Other resource] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM / Illinois prepared to contest the information, because the competition for high speed
Date : 2008-10-13 Size : 9.96kb User : 罗鹏魁
[WinSock-NDIS] DistanceVector_Routing DL : 0: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。 -到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table : - found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing. - Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
Date : 2008-10-13 Size : 2.96kb User : agang
[Fractal program] work2z DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod - Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM / ICPC contest and the preparation of information, because the competit
Date : 2008-10-13 Size : 4.17kb User : kelly
[Other] Bellman_ford DL : 0: bellman-ford的实现。可以输出每条最短路径经过的节点
Date : 2008-10-13 Size : 2.3kb User : 倪焱石
[Other resource] aa DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。
Date : 2008-10-13 Size : 1.15kb User : 王兵
[Other resource] Bellman-Ford DL : 0: 网络优化算法：任两点间最短路径问题的BellmanFord算法
Date : 2008-10-13 Size : 1.7kb User : 叶博
[Mathimatics-Numerical algorithms] Graph-Theory DL : 0: 图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
Date : 2008-10-13 Size : 9.79kb User : lllstar
[matlab] Matlablowestpath DL : 0: Matlab经典算法__最短路径比较好的，能够很好的适应各种不同情况-Matlab classical shortest path algorithm __ relatively good, very good to adapt to different circumstances
Date : Size : 6kb User : ot
[Communication] glomosim-2.03 DL : 0: 比较全的Glomosim2.03,上次下载的那个少个文件夹，导致安装不了，特意在网上搜到了比较齐全的-Comparing the whole of Glomosim2.03, download the last few months of that folder, and can not lead to the installation, specifically the Internet found a relatively complete
Date : Size : 2.72mb User : llt
[Mathimatics-Numerical algorithms] Graph-Theory DL : 1: 图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -err
Date : Size : 10kb User : lllstar
[Data structs] -SPFA DL : 0: Bellman-Ford算法及其改进---SPFA算法_Lifeng Wang.htm-Bellman-Ford algorithm and its improvement--- SPFA algorithm _Lifeng Wang.htm
Date : Size : 18kb User : 刘栋
[Data structs] Bellman-ford DL : 0: 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
Date : Size : 1kb User : JP
[Data structs] Bellman_ford DL : 0: Bellman Ford in another way
Date : Size : 2kb User : tans
[Data structs] belman(2) DL : 0: Dijkstra算法中要求边的权非负，如果遇到负权，则可以采用Bellman-Ford算法。-about bellman-ford
Date : Size : 1kb User : 我下下
[Windows Develop] BellmanFord DL : 0: C++ code for Bellman Ford Algorithm
Date : Size : 1kb User : Neo
[Algorithm] bellman-ford-algorithm DL : 0: 图算法-bellman-ford算法的实现-graph algorithm :bellman-ford cometure
Date : Size : 268kb User : diaozaoxiang
[VC/MFC] Bellman-sxk DL : 0: 最短路径 Bellman-Ford算法与另一个非常著名的Dijkstra算法一样，用于求解单源点最短路径问题。-Bellman Ford
Date : Size : 395kb User : 李帅楼
[Data structs] Bellman-Ford-queue-optimization DL : 0: Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates change.
Date : Size : 1kb User : 翟吉祥
[Data structs] Bellman-Ford DL : 0: Bellman Ford imlplementation
Date : Size : 11kb User : neelabh
[Other] Bellmanform Dynamic Programming DL : 0: Single Source Shortest Path Bellman ford
Date : Size : 195kb User : Mazhar

« 1 2 3 45 6 »