Location:
Search - ford
Search list
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 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
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: 用UDP实现了p2p是的穿透,P2PServer运行在一个拥有公网IP的计算机上，P2PClient运行在两个不同的NAT后（注意，如果两个客户端运行在一个NAT后，本程序很可能不能运行正常，这取决于你的NAT是否支持loopback translation，详见http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt，当然，此问题可以通过双方先尝试连接对方的内网IP来解决，但是这个代码只是为了验证原理，并没有处理这些问题），后登录的计算机可以获得先登录计算机的用户名，后登录的计算机通过send username message的格式来发送消息。如果发送成功，说明你已取得了直接与对方连接的成功。-achieved using UDP p2p is the piercing, P2PServer operation in a public IP with the computer, P2PClient running in two different NAT after (Note If two clients running on a NAT, the procedure may not be operating normally, It depends on whether you support the loopback NAT translation, see http :// midcom-p2p.sourceforge.net/draft-ford- midcom- p2p- 01.txt, of course, this problem can be made by the two sides try to connect with each other to resolve the IP network, but the code is to verify principle, not dealing with these issues), after the computer can log logged in a computer user name, after logged by the computer username send the message format to send information. If the success of this show that you have made a direct link with each other's success.
Platform: |
Size: 31744 |
Author: 刘冰 |
Hits:
Description: 一个模拟P2P聊天的过程的源代码，过程很简单，P2PServer运行在一个拥有公网IP的计算机上，P2PClient运行在两个不同的NAT后（注意，如果两个客户端运行在一个NAT后，本程序很可能不能运行正常，这取决于你的NAT是否支持loopback translation，详见http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt，当然，此问题可以通过双方先尝试连接对方的内网IP来解决，但是这个代码只是为了验证原理，并没有处理这些问题），后登录的计算机可以获得先登录计算机的用户名，后登录的计算机通过send username message的格式来发送消息。如果发送成功，说明你已取得了直接与对方连接的成功。
程序现在支持三个命令：send , getu , exit
send格式：send username message
功能：发送信息给username
getu格式：getu
功能：获得当前服务器用户列表
exit格式：exit
功能：注销与服务器的连接（服务器不会自动监测客户是否吊线）-a peer-to-peer chatting simulation of the process of source code, the process is very simple. P2PServer operation in a public IP with the computer, P2PClient running in two different NAT after (Note If two clients running on a NAT, the procedure may not be operating normally, It depends on whether you support the loopback NAT translation, see http :// midcom-p2p.sourceforge.net/draft-ford- midcom- p2p- 01.txt, of course, this problem can be made by the two sides try to connect with each other to resolve the IP network, but the code is to verify principle, not dealing with these issues), after the computer can log logged in a computer user name, after logged by the computer username send the message format to send information. If the success of this show that you have made a direct link
Platform: |
Size: 30720 |
Author: 李俊升 |
Hits:
Description: 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
Platform: |
Size: 3072 |
Author: agang |
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: 图论算法库 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: 福特的PCB设计规范，写的很详细，不错-Ford
Platform: |
Size: 651264 |
Author: aaa |
Hits:
Description: 这是William Ford,William Topp编写，刘卫东译，严蔚敏审校的数据结构 C++语言描述电子书籍。-This is the William Ford, William Topp prepared, translated Liu, Yan Wei-min data structure Revisers C++ Language to describe e-books.
Platform: |
Size: 20141056 |
Author: 刘名 |
Hits:
Description: bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford realized. Can output of each node after the shortest path
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 我在程序文件中所使用的计算最小费用最大流的算法并没有先用福德－富克逊法算出最大流，然后再用对偶法算出最小费用，而是将两种算法结合，最小费用和最大流一起算出-I said in my program files used in the calculation of the minimum cost maximum flow algorithm does not first Ford- Fu Dixon calculated maximum flow and then calculated the dual minimum cost, but will combine two algorithms, minimum cost and calculate maximum flow together
Platform: |
Size: 1024 |
Author: 积分 |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: |
Size: 47104 |
Author: yangfei |
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: 网络优化算法：任两点间最短路径问题的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: 用c++实现ford算法实现求含负权边最短路径-With c++ Achieve ford algorithm for the right to contain the negative side of the shortest path
Platform: |
Size: 1024 |
Author: wangyu07 |
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: Ford Fulkerson Algorithm
Platform: |
Size: 864256 |
Author: Hoang |
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: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm
Platform: |
Size: 68608 |
Author: xiao |
Hits:
Description: This is an implementation of bellman ford algorithm using java.
Platform: |
Size: 1024 |
Author: giridhar |
Hits: