米迦勒一。约旦，计算机科学部和部门的图形化模型…

一本很好的关于VHDL硬件描述语言方面的书籍，个人觉得写得还不错。-A very good on the VHDL hardware description language books, written personally feel that good.

C++Builder函数查询器-C Builder function for inquiries

RPM coding of spanning tr-RPM coding of spanning tree

在线PING 在线PING 在线PING 在线PING-online PING PING Online Online PING PING online Online online PING PING PING Online Online Online PING PING PING online online PI NG

Mathematica函数及使用方法-Mathematica function and methods of use

介绍了电子实验的一些内容，并具体地讲解了相关实验的步骤．-Introduced some elements of electronic experimentation, and specifically to explain the relevant experimental steps.

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

无废话XMLl(PDF)，适用于初学者使用。-no nonsense XMLl (PDF), applicable to beginners.

python学习用的电子书，对于刚接触python的初学者，很有用的。-python book

《Visual C++.NET应用编程实例进阶》电子书- Visual C++. NET application programming examples Advanced e-books