Description: 图论算法库 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 Platform: |
Size: 4096 |
Author: |
Hits:
Description: Matlab经典算法__最短路径
比较好的，能够很好的适应各种不同情况-Matlab classical shortest path algorithm __ relatively good, very good to adapt to different circumstances Platform: |
Size: 6144 |
Author:ot |
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 算法实现的路由协议，适用距离矢量协议bgp 等， （matlab 源码）-This program uses the Bellman-Ford algorithm to find the set of routing
tables which would be generated in the BGP protocol Platform: |
Size: 1024 |
Author:denver |
Hits:
Description: Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo o-Bellman-Ford Shortest Path Algorithm
(C) 2004 by Yu Hen Hu
find shortest path from a fixed point U to any node V
clear all
n=input( Total number of nodes = )
echo on
starting from a fixed point U, you enter the weight to each
node as the weight on the edge from U to that node V
if there is no such edge, enter inf
when enter a vector, put all number within brackets [ ]
echo off Platform: |
Size: 1024 |
Author:vahid |
Hits:
Search - bellman ford matlab