解析DXF文件图形中圆，椭圆，直线，多段线，单行文字，多行文字以及颜色线型等相关图形实体。...

VC6.0 下开发的一个蓝牙客户端,使用的 widcomm 芯片驱动,API 开发,用于向蓝牙手机FTP 文件,可自动查找周围的蓝牙设备.-VC6.0 developed a Bluetooth client to use the Widcomm chipset driver, API development, used cell phones to Bluetooth FTP file, can automatically search the surrounding Bluetooth devices.

一个计算机的程序 自己写的 不太的好！ 这个程序是对面向对象的应用，他主要是使用了相应的过载的概念，使得计算机能自动识别的浮点，及其他的东西，还有就是相应的虚数，这个市最重要啊的 -a computer to write the procedures themselves are less good! The process of object-oriented applications, he mainly uses corresponding to the concept of overload, making the computer can automatically identify the float, and other things, there is the corresponding virtual few of the city"s most important ah

queke game游戏源码,windows下解压-queke game game source, windows under decompression

目的： 试验多核CPU上排序算法的效率，比较单任务和多任务并行排序算法的差距 内容： 快速排序算法 -Objective: To test multi-core CPU on the efficiency of sorting algorithm to compare single-mission and multi-mission of the gap between the parallel sorting algorithms Content: Quick Sort Algorithm

详细功能 详细功能 详细功能

医院管理系统

一个用VC实现的简单的代理服务器源码,用SOCKET实现.-With VC realize a simple proxy server source code, using SOCKET realize.

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

在mo开发中用vb写的最短路径查询（mopathfinder）-in vb was developed using the shortest path inquiries (mopathfinder)

一些收获，大家共同分享，希望能够方便大家阅读，给大家编成带来些好处。 一些收获，大家共同分享-some harvest, we share the hope that we can facilitate the reading, to bring you into some advantages. Some harvest, we share