Search - ford - CodeBus

[CSharp] CFORD

Description: 以经典的最短路径算法——FORD算法为原理，基于C++平台对其算法研究、验证，通过TXT导入图计算最短路径-Classic shortest path algorithm- Ford algorithm to calculate the shortest path principle, based on the C++ platform of their algorithm, validation, TXT import Figure
Platform: | Size: 200704 | Author: mtimer | Hits:

[Other] El-Gamal-A.--Kim-Y.-H.-Network-Information-Theory

Description: Network information theory aims to establish the fundamental limits on information flow in networks and the optimal coding schemes that achieve these limits. It extends Shannon’s fundamental theorems on point-to-point communication and the Ford–Fulkerson max-flow min-cut theoremfor graphical unicast networks to general networks withmultiple sources and destinations and shared resources. Although the theory is far fromcomplete, many elegant results and techniques have been developed over the past forty years with potential applications in real-world networks. This book presents these results in a coherent and simplified manner that should make the subject accessible to graduate students and researchers in electrical engineering, computer science, statistics, and related fields, as well as to researchers and practitioners in industry.
Platform: | Size: 3757056 | Author: zaman | Hits:

[Other] FordFulkerson

Description: Ford-Fulkerson Algorithm Optimal Task assignment
Platform: | Size: 106496 | Author: Jongho | Hits:

[matlab] filtri

Description: filters used with algazi.ford algotirh to destripe images.
Platform: | Size: 2135040 | Author: salvo | Hits:

[Other] the-shortest-route

Description: 使用matlab编程，图论最短路线的Ford迭代算法、Dijkstra算法和Floyd算法-Ford shortest graph theory iterative algorithm
Platform: | Size: 7168 | Author: rose | Hits:

[Data structs] Ford_Fulkerson

Description: 最大流Ford-Fulkerson算法源代码流量网络中，寻找流量最大的可行流-Ford-Fulkerson maximum flow algorithm source code flow network, looking for the greatest possible flow of traffic
Platform: | Size: 2048 | Author: 李辉 | Hits:

[Special Effects] max_min_segment

Description: 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
Platform: | Size: 38912 | Author: 小马 | Hits:

[Special Effects] Dijkstra

Description: 单源最短路径Dijkstra。使用图论算法作为图像处理的基础算法，Dijkstra和Bellman-Ford类似，都是解决单源最短路径问题，不同的是这个方法只能解决边为非负的问题，实现的好的Dijkstra算法运行时间要快于Bellman-ford。-Single source shortest path Dijkstra. Using graph theory algorithm as the basis of image processing algorithms, Dijkstra and Bellman-Ford similar, are single-source shortest path problem to solve, except that this method can only solve the problem of non-negative side, to achieve a good running time of Dijkstra' s algorithm faster than Bellman-ford.
Platform: | Size: 32768 | Author: 小马 | Hits:

[Data structs] Graph

Description: 图论的各种最短路算法,竞赛用包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue
Platform: | Size: 4096 | Author: Flandre·Scarlet | Hits:

[Other] Project4_BallmanFord

Description: (图论)实现负权重转换(Bellman-Ford) 对于输入的任何一个拓扑(部分边的权重为负)，要求变换网络中边的权重，任意两节点间的最短路不变，输出变换后各边权重。如果网络中存在负环，程序要有报警功能。算法主体写在CGraph类中-(Graph theory) to achieve negative weight conversion (Bellman-Ford) to the input of any topology (some edge weight is negative), requiring transform the network edge weights between any two nodes of the shortest path unchanged, the output transform each edge weights. If the negative loop exists in the network, the program should alarm function. Algorithms written in CGraph class body
Platform: | Size: 8200192 | Author: wendy | Hits:

[matlab] ford-max-flow

Description: 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.
Platform: | Size: 1024 | Author: 刘适 | Hits:

[Internet-Network] UDP_P2P

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的格式来发送消息。如果发送成功，说明你已取得了直接与对方连接的成功-A process simulation p2p chat source code, the process is very simple, p2pserver running on a LAN with a public ip on the computer, p2pclient run on two different nat after (Note that if two clients running on a nat, the program is likely not run properly, depending on whether your nat support loopback translation, see http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt, of course, this problem can be the two sides first try to connect to each other s network ip resolved, but this code is just to verify the principle, and did not deal with these issues), after the logon computer can get logged in the computer s user name, computer and log in through the send username message format to send a message. If the transmission was successful, that you have made to connect directly with each other s success.
Platform: | Size: 133120 | Author: 允锋 | Hits:

[Editor] dsdv

Description: Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm
Platform: | Size: 1024 | Author: KARTHIKEYAN | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list

[CSharp] CFORD

[Other] El-Gamal-A.--Kim-Y.-H.-Network-Information-Theory

[Other] FordFulkerson

[matlab] filtri

[Other] the-shortest-route

[Data structs] Ford_Fulkerson

[Special Effects] max_min_segment

[Special Effects] Dijkstra

[Data structs] Graph

[Other] Project4_BallmanFord

[matlab] ford-max-flow

[Internet-Network] UDP_P2P

[Editor] dsdv

[OS Develop] MaxFlowMinCut_Me

[Data structs] 22-10

[Data structs] Bellman_ford

[Algorithm] FordBellman

[source in ebook] tsp-vb

[matlab] MinimumCostFlow

[OS program] motorPtexture

CodeBus www.codebus.net