数值算法用四组

零件切割问题 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？-parts cutting issue for a fixed width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum?

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

已知图的结点和权值，求初始结点到目标结点的最短路径-Known to map node and weight, find the initial node to the destination node of the shortest path

使用Delphi实现Windows域认证的代码.使用ADSI进行操作-Delphi implementation using Windows domain authentication code. Using ADSI to operate

桌面墙纸我来换。吃软件为代码可以使用 也可以自己修改下。-Desktop wallpaper for me. Ate software code can be used can also be modified under their own.

MFC class for flat buttons. SoftechSoftware Davide Calabro davide_calabro@yahoo.com http://members.tripod.com/~SoftechSoftware/index.html

介绍c++语法，各种库资源，编译器及编译环境。-Introduction c++ Grammar, a variety of library resources, compilers and compiler environment.

用多个例子介绍vb和API的使用方法-Introduce the use of VB and API by many examples

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.-This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.

TVideoGrabber Video Capture and Media Player component