JBuild开发人员使用指南

visualc++小波变换技术与工程实践的源代码作者：向世界证明

深入浅出MFC第二版，一本很好的MFC编程的书，有繁体版和简体版的，这里是简体-MFC easy second edition, a very good book MFC Programming, has Traditional and Simplified versions, here is the simplified

本书内容分上、下两册出版。本套书是关于Microsoft Visual C++ 6.0基础类库(MFC)完整的参考手册。全面性和权威性是本书最大的特点。MFC库按照应用的功能划分为根类，MFC应用结构类，窗口、对话和控件类，绘画和打印类，简单的数据类型类，数组、列表和映射类，文件和数据库类，Internet和网络类，OLE类，调试和异常类等类。而其中的每一分类都是应用编程或其中某个方面的重要课题。本书按字母次序排列了MFC全部的类，并详细介绍了每一个类的成员，包括成员函数和数据成员，以及类之间的关系，如派生等。对于典型的用法，本书在用常规方法解释之余，还附加了精炼的代码示例，可供读者揣摩、研究。类库2-book covers, published in two volumes. Bentaoshu on Microsoft Visual C 6.0 basis Class (MFC) comprehensive reference hands register. Comprehensive and authoritative book is the greatest characteristics. MFC according to the application of functional roots category, MFC Application category structure, windows, dialogue and control classes, painting and print category, simple data type category, arrays, class lists and maps, documents and database category, Internet and network categories, OLE category, debugging and unusually for such category. And the classification is applied for each program or some aspect of an important topic. The book arranged in alphabetical order of all of the MF

PB中文参考书。对于利用PB的进行数据库前端开发的程序员，有很好的参考价值。其中包含PB的各种控件与函数的详细介绍。-PB Chinese reference books. The use of PB database front-end development programmers, a good reference value. PB contains the controls and functions in detail.

c Language Teaching Book version 1.72

Developing OpenTools是面对中高级的Java语言开发者的书籍，主要是利用JBuilder的OpenTools工具来进行开发需要的。书的末一节有编程实例讲解。-Developing OpenTools face of the middle- and high-level Java language development of books, mainly using the OpenTools JBuilder tool for the needs of the development. The end is a programming examples on.

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]

一本介绍缓冲区溢出和非常好的书，讲解详细，通俗易懂，是值得收藏的好资料- describes a buffer overflow and a very good book to explain the detailed, easy to understand, is worthy of a good collection of information

The book for gamedesigner

不说都知道，不过与电脑无关-not know, but a computer