用VC写的学习材料的DLL动态链接库DLL，使用新手李尔…

make和makefile详解，大家有兴趣看看吧-make and makefile explain, we are interested to see it

c++ primer 双语版的，对原文有兴趣的可以多借鉴下-c++ primer bilingual version of the original interested parties can learn from the next

图论中最小生成树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]

Addison Wesley - Imperfect C++. Practical Solutions for Real-Life Programming-Addison Wesley- Imperfect C++. Practical Solutions for Real-Life Programming

ERP的经典教程，刚在别的论坛下载的工大家分享了，很简单的一看就会。-ERP classic guide, only in other public forums download a share, a very simple one will do.

oracleproc编程2-oracleproc Programming 2

清华大学出版社出版的，由周靖和黄都培翻译的-Tsinghua University Publishing House by ZHOU Jing and Huang Pei translation are

S3C2410中文翻译第十四章，LCD控制器。-S3C2410 Chinese translation of the 14th Chapter, LCD controller.

列出所有的显示模式并列表出来，通过单击列表来改变显示分辨率。-listed all modes and the list, and click through the list to change the display resolution.

C Traps and Pitfalls 经典书籍。 有些内容些许过时， 但绝对值得看一遍-C Traps and Pitfalls classic books. Some of the contents little late, but definitely worth Howard