搜索资源列表
Minimum-phase
- minimum phase in the communication system
5
- 输入三个整数x,y,z，请把这三个数由小到大输出。 1.程序分析：我们想办法把最小的数放到x上，先将x与y进行比较，如果x>y则将x与y的值进行交换，然后再用x与z进行比较，如果x>z则将x与z的值进行交换，这样能使x最小。-Enter the three integers x, y, z, please these three the number of small to large output. 1. Program
最大流最小割定理
- 最大流最小割定理-maximum flow minimum cut theorem
最小生成树byhuyun
- 一个根据给定的图，计算出最小生成树的程序-according to a set plan, the calculated minimum spanning tree procedures
最短路径和最小生成树
- 最短路径和最小生成树-shortest path and minimum spanning tree
求网络的最小费用最大流网络版
- 求网络的最小费用最大流网络版-for the minimum cost network flow largest online edition
最小生成树耶
- 最小生成树-minimum spanning tree
最小生成树123
- 最小生成树绝对可以运行的程序-absolute minimum spanning tree can run the procedure
duoduantu
- 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures fo
MST_without input
- kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.
实验报告-最小生成树
- 关于最小生成树问题的基本思想运行结果测试平台以及源码-minimum spanning tree problem on the basic idea of operating results and the source test platform
图论常用算法通用matlab程序
- 包括最短路及最小生成树算法，对于参加建模很有用的-including the most short-circuit and the minimum spanning tree algorithm, for participating in modeling very useful
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
Minimum-EnergyAsynchronous
- Minimum-Energy Asynchronous Dissemination to Mobile Sinks in Wireless Sensor Networks
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum
function minimum
- Finding fuction minimum and maximum
minimum filter
- low pass minimum filter
82429-minimum-row-value-and-return-the-row
- Minimum row value and return row