a VC Debug environment on the use of the document, although not so thorough, but...

Java™ Platform, Enterprise Edition (Java EE) Specification, v5-Java™ Platform, Enterprise Edition (Java EE) Specification, v5

数据仓库1-3.pdf-Data Warehouse 1-3.pdf

3D显示教材,由浅入深,一本很好OPENGL教材.-3D display materials, easy-to-digest, a very good teaching OPENGL.

Windows2000编程技术内幕-Windows Programming Insider

该执行程序能查阅目前常用的移动通信名词解释意义，非常的适用！-Basic letters obout mobile communications

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

STi7100 Datasheet for receivers

对维护您的电脑很有帮助-The maintenance of your computer helpful

《代码大全》中文版 Steve McConnell著 天奥 译-" Code complete"

基于java和acess开发的药品管理系统,实现基本功能-java and acess the development of drug management system