唯一官方最好的的qt编程知道书籍，奇趣公司用来进行内部员工培训的教材。...

spring培训学习笔记,学习spring的可以参考一下-spring training study notes, study and reference for the spring

《Visual C++ MFC编程实例》配套代码,如果大家正在学习此教程，而没有配套代码的，欢迎下载哟！- Visual C++ MFC programming examples package code, if we are learning this tutorial, but there is no matching code are welcome to download yo!

一个企业代码，美工很不错~！适合做中小企业网站-daima

uClinux u Clinux uClinux

C语言经典的一些程序，对初学C语言非常有帮助。-C language classic procedures of learning C language very helpful.

这本书是《Logistic 回归模型---方法与应用 》作者：王济川 郭志刚，这是一本关于Logistic 回归的经典书籍 另外还上传了数据-this book is "Logistic regression model-- Methods and Applications" Author : Wang Chuan Guo Zhigang, This is a logistic regression on the classic books also upload data

matlab5的使用守则，很有用呦。我看了写的还蛮详细的。大家一定要挺呀。-matlab5 the use of codes of practice, very useful Yo. I have read quite a detailed written. Rather it must be everybody.

C 程序员参考手册-C programmer"s reference manual

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

这是一个介绍windows api编程的书，主要应用于2000/xp系统，有兴趣的可以看看哦，很实用．-windows api programming on the books, which are mainly used 2000/XP systems, are interested can see, oh practical.