关于C++的程序书写规范 一个好的软件应该是这样的：它有着经过周密计划和审慎设计的完美的内部结构，同时又具有让人赏心悦目的精美的外观。这样的软件，你可以称它...

Linux编程用户手册，对于Linux地下的编程很有实用-linux user guide

Microsoft Jet SQL参考 -Microsoft SQL reference Jet

C语言程序设计谭浩强・CHM.chm c语言学习常用版本-C Language Programming CHM.chm c Hao strong language commonly used version of

O Reilly The perl CD bookshelf including : Perl in a Nutshell book learning perl Learning Perl on Win32 Systems Programming Perl Advanced Perl Programming Perl Cookbook

名校微电子专业数字集成电路设计课件，共十三章。-Microelectronics elite professional digital IC design software, a total of 13 chapters.

As part of the course work on the course "Information management systems testing aircraft" required to develop a software package that implements the following functions: providing cartographic support, positioning the cursor, to calculate the distance between two points, building trails spacecraft (SC) construction zone of radio visibility of satellites and surveillance zones construction cyclograms communications by ground tracking station and spacecraft-As part of the course work on the course "Information management systems testing aircraft" required to develop a software package that implements the following functions: providing cartographic support, positioning the cursor, to calculate the distance between two points, building trails spacecraft (SC) construction zone of radio visibility of satellites and surveillance zones construction cyclograms communications by ground tracking station and spacecraft

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

S3C44B0实验指导（S3C44B0 experimental guide）-S3C44B0 experimental guide

php中文技术手册 最新版，学习PHP必备书籍-php latest version of the Chinese technical manuals to learn PHP essential books

Linux in a Nutshell, 5th Edition By Stephen Figgins, Robert Love, Arnold Robbins, Ellen Siever, Aaron Weber ... ... ... ... ..... Publisher: O Reilly Pub Date: July 2005 ISBN: 0-596-00930-5 Pages: 944 Over the last few years, Linux has grown both as an operating system and a tool for personal and business use. Simultaneously becoming more user friendly and more powerful as a back-end system, Linux has achieved new plateaus: the newer filesystems have solidified, new commands and tools have appeared and become standard, and the desktop--including new desktop environments--have proved to be viable, stable, and readily accessible to even those who don t consider themselves computer gurus. -Linux in a Nutshell, 5th Edition By Stephen Figgins, Robert Love, Arnold Robbins, Ellen Siever, Aaron Weber ... ... ... ... ... ... ... ..... Publisher: O Reilly Pub Date: July 2005 ISBN: 0-596-00930-5 Pages: 944 Over the last few years, Linux has grown both as an operating system