Location:
Search - ford bellman
Search list
Description: Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
Platform: |
Size: 18432 |
Author: wc |
Hits:
Description: 用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.
Platform: |
Size: 103424 |
Author: 李文 |
Hits:
Description: bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford realized. Can output of each node after the shortest path
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。-Graph Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through.
Platform: |
Size: 1024 |
Author: 王兵 |
Hits:
Description: Bellman-Ford算法。在最短路径和差分约束用的比较广泛-Bellman-Ford algorithm. Difference in the shortest path and constrained by the relatively wide
Platform: |
Size: 1024 |
Author: pillar |
Hits:
Description: 网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues
Platform: |
Size: 1024 |
Author: 叶博 |
Hits:
Description: 这个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm, the use of java programming.
Platform: |
Size: 16384 |
Author: cwh |
Hits:
Description: 使用Java语言编写模拟路由器程序，通过不同的IP端口（port），使用多线程模拟不同的路由器，路由器之间通过UDP协议交换路由信息，根据Bellman-ford算法确定下一条的路由节点。-The use of Java language router simulation procedures, through different IP port (port), the use of multi-threaded simulation of different routers, through the UDP protocol between routers exchange routing information, according to Bellman-ford algorithm to determine the next a routing node.
Platform: |
Size: 43008 |
Author: 邓瑞龙 |
Hits:
Description: bellman-ford的模板，方便大家使用，可以直接粘贴使用-bellman-ford template to facilitate the use of paste can be directly used
Platform: |
Size: 1024 |
Author: lcx |
Hits:
Description: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm
Platform: |
Size: 18432 |
Author: xiao |
Hits:
Description: This is an implementation of bellman ford algorithm using java.
Platform: |
Size: 1024 |
Author: giridhar |
Hits:
Description: bellman algorithm program implented in c++
is based on using linked list-bellman algorithm program implented in c++
is based on using linked list
Platform: |
Size: 1024 |
Author: kushal |
Hits:
Description: ns2下dsdv实现代码。DSDV（Destination-Sequenced Distance-Vector）协议是先应式路由协议，是由传统的Bellman-Ford 路由协议改进得到的，其特点是利用目的节点序列号解决了DBF算法的路由环路和无穷计数问题。-dsdv the realization of the code under ns2. DSDV (Destination-Sequenced Distance-Vector) protocol is proactive routing protocol, is the traditional Bellman-Ford Routing Protocol has been improving, and its destination node is characterized by the use of the serial number of the DBF algorithm to solve the routing loop and count the issue of infinity.
Platform: |
Size: 17408 |
Author: 开开 |
Hits:
Description: Bellman-Ford算法 在图的应用中遇到负权，则可以采用Bellman-Ford算法来计算单源最短路径。-Bellman-Ford
Platform: |
Size: 3072 |
Author: 吉铭 |
Hits:
Description: this is c++ program for bellman ford algorithm
Platform: |
Size: 1024 |
Author: brijendra kumar |
Hits:
Description: Bellman-Ford算法的源代码。大伙自己看吧，看不懂的allenlsy@gmail.com-code for algorithm bellman-ford. allenlsy@gmail.com
Platform: |
Size: 1024 |
Author: lsy |
Hits:
Description: bellman 方程的matlab实现,十分不错的源代码-bellman function matlab
Platform: |
Size: 2048 |
Author: lif |
Hits:
Description: Bellman ford 算法描述即实现-Bellman ford algorithm description of achieving
Platform: |
Size: 54272 |
Author: gec |
Hits:
Description: 用Java语言写的移动通信网络（ad hoc）中很多经典的路由协议所用到的Bellman-Ford算法，使用到多线程和UDP协议来进行数据传输-Written using Java language for mobile communications network (ad hoc), many of the classical routing protocols used by the Bellman-Ford algorithm, using the multi-threaded and UDP protocols for data transfer
Platform: |
Size: 3072 |
Author: 唐叶 |
Hits:
Description: bellman-ford algorithm to find shortest distance in a graph. useful for path planning.
Platform: |
Size: 1024 |
Author: frank dave |
Hits: