12、SPSS统计分析和指导（该项目）（作者：文

很经典的一部c++设计参考书-classic design of a reference c

2006 软件评测师考试试题及答案 pdf格式-2006 software testing questions and answers pdf

讲述了音频处理电路的技术，列举了若干技术问题的解决方法-described Audio processing circuit technology, cited a number of technical problems solution

Biomedical E-Book for Electronic Eng

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

用Kruskal算法实现若干个城市之间的最短路径.最大城市数目为7个.-algorithm using Kruskal several cities in the shortest path. The number of the largest city in seven.

高质量C++，C的编程指南，通过此书，可以改善编程质量和效率。-High-quality C++, C programming guide, through this book, you can improve the quality and efficiency of programming.

VMware Workstation 6 基本使用指南，帮助读者快速掌握VMware Workstation 6的基本使用。-VMware Workstation 6 basic user guide to help readers gain a quick VMware Workstation 6 the basic use.

CodingTheory MIT的课件~~学习CodingTheory的必备外国资料-CodingTheory MIT courseware ~ ~ Learn the necessary foreign CodingTheory information

是C语言编写的游戏程序-is prepared by the C language Games