opencv制作路标的训练图片

1. WHAT IS DELPHI DISTILLER Delphi Distiller is a customization tool for Delphi 5/6/7/2006/2007/2009/2010 that allows you manage packages and experts and apply several tweaks. 2. FEATURES • Choose what packages and experts are loaded by Delphi 5/6/7/2006/2007/2009/2010. • Downloads page for Delphi 5/6/7/2006/2007/2009/2010. • File associations manager for Delphi 5/6/7/2006/2007/2009/2010. -1. WHAT IS DELPHI DISTILLER Delphi Distiller is a customization tool for Delphi 5/6/7/2006/2007/2009/2010 that allows you manage packages and experts and apply several tweaks. 2. FEATURES • Choose what packages and experts are loaded by Delphi 5/6/7/2006/2007/2009/2010. • Downloads page for Delphi 5/6/7/2006/2007/2009/2010. • File associations manager for Delphi 5/6/7/2006/2007/2009/2010.

一个非常漂亮的分析软件界面，对界面感兴趋的可以给点意见。-Stock market analysis system, beautiful interface.

ASCII码和GB2312-80标准汉字库的数组形式,可直接在C语言中调用-ASCII codes and GB2312-80 standards for Chinese Character array of forms, can be called directly in the C language

对链表的综合性的应用.(单链表).对于初学者联系链表的结构和使用过程有帮助.-Comprehensive list of applications. (Single list). Contact list for beginners to use the structure and process to help.

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

一个插件示例，详细讲解了用VC做COM插件的方法，内附文档。

自己做的贪吃蛇代码,比较简单易懂,-The Snake make their own code, and relatively easy to understand

这个程序的头文件中包含四种排序方法：泡沫排序法（bubble），插入排序法（insertion），快速排序法（quick）和选择排序法（selection）。头文件中还使用了模板技术，以便可以同时实现几种类型的排序算法。 dinimicky_hu对原程序做了修改和优化，使用了函数指针数组,并修改了一个BUG-The head file of this programme includes 4 methods of sorting : Bublle sorting,insertion sorting,quick sorting and selection sorting.Some template technics are included in the head file in order to make these sorting metods achieved in the same time . The source code is recomposed and optimized by Dinimicky_hu , using the some arrays of function pointer ,and amened some bugs.

字模提取小程序，编程的好助手，希望大家有帮助，很好用的哦。-Fonts small extraction procedure, the good programming assistant, we want help with the oh good.

该资源为程序设计专题课程中，运用MFC编写的小游戏，狼羊棋。通过简单的MFC设计，初步理解面向对象的程序设计思想。可以作为入门的图形界面设计与后台程序相结合的入门程序。代码可读性强，逻辑清晰。存在一部分逻辑小问题，读者也可以自行解决。