Welcome![Sign In][Sign Up]
Location:
Search - minimum

Search list

[Other resourceMinimum-phase

Description: minimum phase in the communication system
Platform: | Size: 16381 | Author: name | Hits:

[assembly language5

Description: 输入三个整数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 analysis: We think of a way to put x number of the smallest, the first comparison of x and y, if x> y will be the value of x and y exchange and then to compare x and z, if x > z will be x and z values of the exchange, which will enable x minimum.
Platform: | Size: 19456 | Author: | Hits:

[Documents最大流最小割定理

Description: 最大流最小割定理-maximum flow minimum cut theorem
Platform: | Size: 2048 | Author: 张志明 | Hits:

[Mathimatics-Numerical algorithms最小生成树byhuyun

Description: 一个根据给定的图,计算出最小生成树的程序-according to a set plan, the calculated minimum spanning tree procedures
Platform: | Size: 145408 | Author: 胡云 | Hits:

[Other最短路径和最小生成树

Description: 最短路径和最小生成树-shortest path and minimum spanning tree
Platform: | Size: 1024 | Author: 徐宾 | Hits:

[Mathimatics-Numerical algorithms求网络的最小费用最大流网络版

Description: 求网络的最小费用最大流网络版-for the minimum cost network flow largest online edition
Platform: | Size: 18432 | Author: 韩丹 | Hits:

[Documents最小生成树耶

Description: 最小生成树-minimum spanning tree
Platform: | Size: 1024 | Author: 小米 | Hits:

[Mathimatics-Numerical algorithms最小生成树123

Description: 最小生成树绝对可以运行的程序-absolute minimum spanning tree can run the procedure
Platform: | Size: 60416 | Author: 涛涛 | Hits:

[Algorithmduoduantu

Description: 这是计算机算法基础中的动态规划的方法的一个例子,多段图是一个很经典的问题!这里的程序用于求解最小成本路径,用类似的思想可以解决最优分配方案的问题!-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 for calculating the minimum cost path, with similar ideas can solve the optimal distribution program!
Platform: | Size: 5120 | Author: 中国 | Hits:

[Data structsMST_without input

Description: kruscal的源代码,实现最小生成树的算法,这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.
Platform: | Size: 1024 | Author: 涂奎 | Hits:

[VC/MFC最小生成树的kruskal算法

Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码,很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good.
Platform: | Size: 7168 | Author: 胡冰 | Hits:

[JSP/Java实验报告-最小生成树

Description: 关于最小生成树问题的基本思想运行结果测试平台以及源码-minimum spanning tree problem on the basic idea of operating results and the source test platform
Platform: | Size: 7168 | Author: wjf | Hits:

[matlabPrim-minimum-spanning-tree-algorithm

Description: 最小生成树Prim算法的matlab文件,无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
Platform: | Size: 1024 | Author: 小明 | Hits:

[Data structsK-degree-constrained-minimum-spanning-tree

Description: 本压缩包完整地实现了最小可度限制生成树的算法程序,代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
Platform: | Size: 2048 | Author: 榔头 | Hits:

[Industry researchMinimum-EnergyAsynchronous

Description: Minimum-Energy Asynchronous Dissemination to Mobile Sinks in Wireless Sensor Networks
Platform: | Size: 350208 | Author: Roxanne | Hits:

[Data structsMinimum-spanning-tree

Description: 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 G tree called G of the spanning tree (G connected). The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and. The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
Platform: | Size: 1024 | Author: 江洋 | Hits:

[Data structscut-the-minimum-cut-problem

Description: 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 cut problem network G = (V, E) of the cut cut (S, T) is the vertex set V of G into two disjoint subsets S and T, so that s Î S, t Î T, and cut ( S, T) = {(u, v) Î E | u Î S, vÎ T}. Let each edge (u, v) the right side is a (u, v), then cut cut (S, T) has a weight cut (S, T) and the rights of all sides. Minimum cut problem requires a network G, the minimum weight cut.
Platform: | Size: 336896 | Author: yjian | Hits:

[Otherfunction minimum

Description: Finding fuction minimum and maximum
Platform: | Size: 32768 | Author: elvin_137 | Hits:

[matlabminimum filter

Description: low pass minimum filter
Platform: | Size: 24576 | Author: Beny7 | Hits:

[Other82429-minimum-row-value-and-return-the-row

Description: Minimum row value and return row
Platform: | Size: 125952 | Author: sachin | Hits:
« 12 3 4 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net