有关软件工程的书籍资料

java data object 作者： David Jordan, Craig Russe-java data object Author : David Jordan, Craig Russe

this a simple mfc program to create a simple frame window-this is a simple mfc program to create a simple frame window

动态链接库程序的编写,如何利用工具查看动态链接库输出的函数，Depends工具的使用-dynamic link library program, how to use the tool View DLL exporting the function, Depends the use of tools

ORGE中文帮助文档，让你快速了解使用ORGE-ORGE English help documents, allows you to quickly learn more about using ORGE

一种考虑节点能量的无线传感器网络的分簇算法，对研究路由算法有帮助-Consider the energy of a node of the wireless sensor network clustering algorithm, routing algorithm for research help

java ant daquan

SQL的教程，我曾经学过，非常推荐，21天就能学会-SQL tutorial, I have learned that very recommendation, 21 days will be able to learn

《Visual C++.NET专业项目实例开发》配书源代码-"Visual C.NET example of professional development projects "assigned book source code

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