Search - ford bellman

Search - ford bellman - List

[Mathimatics-Numerical algorithms] bellman DL : 0: 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algorithm, The algorithm can be used to solve signal processing some of the problems. Bellman_ford.c to source; distance.txt document repository all the distance between points, to 99,999 infinite said. bellman_ford.txt document output files, storage cycle round the middle value, and, finally, the various nodes of the shortest distance, if the plan contains negative loop, the paper returns FALSE.
Date : 2008-10-13 Size : 8.13kb User : 李文
[Multimedia program] Bellma-Ford DL : 0: Bellman-Ford算法。在最短路径和差分约束用的比较广泛
Date : 2008-10-13 Size : 830byte User : pillar
[Other resource] Bellman-Ford算法 DL : 0: Bellman-Ford算法是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
Date : 2008-10-13 Size : 18.28kb User : wc
[Data structs] 图论算法库 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 : Size : 10kb User : 罗鹏魁
[Internet-Network] 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 : Size : 3kb 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 : Size : 4kb User :
[.net] clustering DL : 0: bellman ford algorithm implemented in C#.NET
Date : Size : 794kb User : piyu
[JSP/Java] 105230321aodv DL : 0: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm
Date : Size : 67kb User : xiao
[Windows Develop] bellman_Ford DL : 0: BF算法实现，Bellman-Ford 网络优化算法，CSPF部署-Bellman-Ford
Date : Size : 2kb User : william
[Data structs] BELLMAN DL : 0: program for bellmann ford used in ada in c language
Date : Size : 1kb User : rohit
[Graph program] bellman-ford DL : 0: bellman ford algorithm
Date : Size : 1kb User : rony
[JSP/Java] BFSimple DL : 0: Bellman-Ford Algoritm in Java
Date : Size : 1kb User : tans
[TCP/IP stack] BGP DL : 1: 用Bellman-Ford 算法实现的路由协议，适用距离矢量协议bgp 等，（matlab 源码）-This program uses the Bellman-Ford algorithm to find the set of routing tables which would be generated in the BGP protocol
Date : Size : 1kb User : denver
[Data structs] pku_3259 DL : 0: pku3259 Bellman-Ford
Date : Size : 1kb User : semiok
[Algorithm] bellman DL : 0: bellman-ford算法，典型最短路算法，用于计算一个节点到其他所有节点的最短路径-bellman-ford algorithm, a typical shortest path algorithm for computing a node to all other nodes of the shortest path
Date : Size : 4kb User : 我下下
[JSP/Java] Bellman-ford DL : 0: Bellman-ford Algorithm
Date : Size : 171kb User : Thiago
[Mathimatics-Numerical algorithms] Bellman-Ford DL : 0: bellman-ford +spfa 求最短路径的算法总结-bellman-ford+ spfa summary of the shortest path algorithm
Date : Size : 96kb User : lianjx
[Internet-Network] ford.c DL : 0: Ford algorithms trees The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem. Thus, Bellman–Ford is used primarily for graphs with negative edge weights. The algorithm is named after its developers, Richard Bellman and Lester Ford, Jr.
Date : Size : 1kb User : darulor
[Data structs] bellman DL : 0: 实现的是Bellman-Ford负权最短路径算法-To achieve the Bellman-Ford shortest path algorithm for negative weights
Date : Size : 1kb User : 张佳静
[Data structs] Bellman-Ford-algorithm DL : 0: 本程序是用C语言来实现Bellman-Ford算法，希望能对别人有帮助!-The program is implemented in C language Bellman-Ford algorithm, hoping to help others!
Date : Size : 1kb User : 代伟

« 1 23 4 5 6 »