中华古籍，对大家了解中国传统文化有重大帮助。并且很小哦...

How.Linux.Works.What.Every.Super.User.Should.Know..一本很不错的初学linux的书，同时也温习一下英语-How.Linux.Works.What.Every.Super.Use r.Should.Know .. a very good beginner linux book, also study what English. .

我想这是一本对任何学习JAVA的人都有用的手册――Java 快速查询手册-pdf-I think this is one pair of no learning Java has the manual-- Quick inquiries manual Java-pdf

delphi7编程-delphi7 Programming

感到很反对回复经国家富豪和 东方鼓腹含和超负荷红-Reply by the state was very much opposed to the rich and East is Red

西门子EWSD系统概述 1 EWSD 的应用 2 EWSD 硬件概述 3 数字用户线路单元(DLU)的功能结构 4 线路中继组(LTG)的功能结构 5 远端交换单元(RSU)的功能结构 6 SN 功能结构 7 协调处理机(CP)的功能结构 8 SS7 网络的功能结构 9 应用程序系统(APS) 10 EWSD 内部呼叫建立概述 -Siemens EWSD System Overview 1 EWSD Application 2 EWSD hardware overview 3 digital subscriber line unit (DLU) of the functional structure of 4-line relay group (LTG) the function of the structure of 5 remote exchange unit (RSU) of the functional structure 6 SN functional structure 7 Coordination Processor (CP) function of the structure of 8 SS7 network functional structure 9 applications system (APS) 10 EWSD an overview of the internal call setup

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

本资料大全致力于收集一切关于C语言的文章、技巧、教程、源代码和辅助工具软件。适合所有层次的C语言学习者。本资料大全免费下载，如您手头也有C语言相关资料，敬请分享，另外如您对本资料大全有任何建议或者意见希望能告诉我，以便以后继续改进-Book dedicated to the collection of this information all the articles on the C language, techniques, tutorials, source code and support tools. Suitable for all levels of the C language learners. Book a free download of this information, if you have C language on-hand information, please share other information such as the Encyclopedia of you have any suggestions or want to tell me their views in order to continue to improve after

学习MFC控件使用的好书籍，里面的介绍十分详细！-??MFC ?

初学LINUX的好东东，-beginners LINUX good price.

SoC Design Flow and Tools