java并发编程经典之作，不适合初学者。细细研读受益匪浅

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

关于c的一个资料，名字为c教程，是chm版的适合初学者-With regard to c, a data name for the c tutorial chm version is suitable for beginners

数据库操作--ODBC篇-database operations-- Part ODBC

2003-12-20_Windows Driver Model

休闲书籍 四季传说-leisure books Seasons legend

基于MFC和ADO的股票数据上传系统，内附详细编程过程-Based on the MFC and ADO stock data upload system, containing a detailed programming process

南京大学JAVA教程-Nanjing University Guide JAVA

hibernate中文教程是从国外一本书中翻译过来的，是学习hibernate很好的教程。-hibernate English curriculum was a book from abroad, translated, is a good tutorial to learn hibernate.

章立民－visual stadio 2005 c＃编程技巧-Zhang Li-min-visual stadio 2005 c# programming skills

c++Primer搞C++必看此书 -c++ Primer engage C++ see this book