Java2游戏程序设计

Visual C++基础教程书-Visual Basic Course on C

基于OPNET的无线电网络仿真，为Opnet网络仿真的实例-based radio network simulation, network simulation for Opnet examples

C++语言的发明者stroustrup写的。介绍了c＋＋语言的发展史。对想深入了解C＋＋的人很有帮助。-C language inventors Stroustrup wrote. Introduced c++ language development. Right to acquire a deeper understanding of C++ were very helpful.

内嵌实时系统的例子-embedded real-time systems example

Efilm workstation 2.12中文手册-Efilm workstation 2.12 Chinese Manual

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

《TCP/IP详解，卷1：协议》是一本完整而详细的TCP/IP协议指南。描述了属于每一层的各个协议以及它们如何在不同操作系统中运行。-《TCP/IP Detailed, Volume 1: The agreement》is a complete and detailed TCP/IP protocol guidelines. Describe each level belonging to the various agreements and how they run on different operating systems.

应用于项目管理的书籍，可以看看。-applied project management books, can look at.

vb调用api函数-vb function called api

The book presents the entire Java programming language and essential parts of the class libraries: the collection classes and the input-output classes.