如做电子书籍一个小软件。

程序代码说明 灰度AGV路径识别 彩色AGV路径识别 HSI彩色空间的AGV路径识别 路径中心线的定位 Radon变换的AGV路径偏差检测-code shows gray color Path Recognition AGV AGV Path Recognition of the HSI color space AGV Road Path Recognition path centerline Radon transform the positioning of AGV path deviation detection

《ASP.NET案例开发集锦》配套光盘，电子工业出版社，2006

c++bulider参考手册源码-c bulider reference manual FOSS

weblogic中文帮助，对于初学者是个很好的手册。里面还描述对j2ee的支持-Weblogic Chinese help for beginners is a very good manual. They also described the support for J2ME

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

老外写的3d图形编程指南，英文原版-foreigners write 3d Graphics Programming Guide, English original

m8 的 中文资料 很全 希望对大家有帮助 -M8 pdf

这是一本关于VisualC++的MFC编程的电子书-This is an on VisualC++ The MFC programming e-books

包含了c的很多题型，有助于初学者更好更快的了解的C语言的题型！-C contains a lot of kinds of questions can help beginners better and faster understanding of the C language kinds of questions!

Keil C51的中文教程，是初学者的很好学习材料-Keil C51 Chinese tutorial is a good learning materials for beginners