Search - Ford matlab

[Other resource] graphprogramming

Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序
Platform: | Size: 47582 | Author: yangfei | Hits:

[Fractal program] work2z

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:

[matlab] Matlablowestpath

Description: Matlab经典算法__最短路径比较好的，能够很好的适应各种不同情况-Matlab classical shortest path algorithm __ relatively good, very good to adapt to different circumstances
Platform: | Size: 6144 | Author: ot | Hits:

[matlab] graphprogramming

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:

[Windows Develop] Ford-Fulkerson

Description: Ford-Fulkerson Min cut / Max flow-Ford-Fulkerson Min cut/Max flow
Platform: | Size: 6144 | Author: M | Hits:

[Internet-Network] dsdv

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:

[OpenGL program] Ford-Fulkerson

Description: THIS ZIP SIMULATE THE APPLICATION OF THE FORD FULKERSON ALGORITHM WHICH ALLOWS TO SEARCH THE MAXIMUM FLOW
Platform: | Size: 1024 | Author: Dan | Hits:

[Other systems] Q1_3

Description: bellman 方程的matlab实现,十分不错的源代码-bellman function matlab
Platform: | Size: 2048 | Author: lif | Hits:

[TCP/IP stack] BGP

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:

[matlab] GraphTheoryAlgorithmMATLAB

Description: 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.
Platform: | Size: 47104 | Author: 肖翔 | Hits:

[matlab] New-WinRAR-ZIP-archive

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:

[matlab] MaxFlowMinCut_Me

Description: 利用Ford--Fulkerson 标号法求最大流算法的MATLAB 程序代码-The use of Ford- Fulkerson labeling method for the maximum flow algorithm of MATLAB code
Platform: | Size: 1024 | Author: yangjie | Hits:

[matlab] Matlab_zuixiaoerchengfa

Description: 最小费用最大流算法通用Matlab函数基于Floyd最短路算法的Ford和Fulkerson迭加算法基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流.- Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.
Platform: | Size: 5120 | Author: fuhai | Hits:

[matlab] Matlab_zuixiaofeiyong

Description: 最小费用最大流算法通用Matlab函数基于Floyd最短路算法的Ford和Fulkerson迭加算法基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流.-Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.
Platform: | Size: 4096 | Author: fuhai | Hits:

[Other] graph-theory-in-matlab

Description: 图论算法及MATLAB程序代码,包含算法pdf文档和M文件。Warshall-Floyad算法，Kruskal避圈法，匈牙利算法，可行点标记求最佳匹配算法，Ford--Fulkerson标号法求最大流算法，最小费用最大流算法。求解数学模型必备！-Graph theory algorithms and MATLAB code contains of algorithm pdf documents and M files. The the Warshall-Floyad algorithm, Kruskal avoid lap law, Hungary algorithm feasible point mark for the best matching algorithm, Ford- Fulkerson labeling method for maximum flow algorithm, minimum cost maximum flow algorithm. To solve the mathematical model is essential!
Platform: | Size: 207872 | Author: Binjie Liao | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list